fork download
copy 
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4.  
  5.  
  6. bool isPrime(int n) {
  7. 	for(int i = 2; i < sqrt(n); ++i) {
  8. 		if(n % i == 0) {
  9. 			return false;
  10. 		}
  11. 	}
  12. 	return true;
  13. }
  14.  
  15. int main() {
  16. 	std::vector<int> primes {2,3};
  17. 	for(int i = 5; i < 200; i+=2) {
  18. 		if(isPrime(i)) {
  19. 			primes.push_back(i);
  20. 		}
  21. 	}
  22. 	std::cout << "There are " << primes.size() << " primes under 200" << std::endl;
  23.  
  24. 	return 0;
  25. }
Success #stdin #stdout 0s 3428KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
There are 51 primes under 200
https://ideone.com/rhwhQQ
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!