fork download
copy 
  1. #include <iostream>
  2. #include <cmath>
  3.  
  4. using std::cout;
  5. using std::endl;
  6.  
  7. bool isPrime(int);
  8.  
  9. int main() {
  10. 	int i;
  11. 	long sum = 0;
  12.  
  13. 	for (i = 2; i < 1000; i++) {
  14. 		if (isPrime(i)) sum = sum + i;
  15. 	}
  16.  
  17. 	cout << sum << endl;
  18.  
  19. 	return 0;
  20. }
  21.  
  22. bool isPrime(int num) {
  23. 	int j;
  24.  
  25. 	for (j = 2; j <= ((static_cast<int>(pow(num,0.5)+1))); j++) {
  26. 		if (((num % j) == 0) && (j != num)) return false;
  27. 	}
  28.  
  29. 	return true;
  30. }
Success #stdin #stdout 0s 3340KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
76127
https://ideone.com/oYRbE7
language:
C++14 (gcc 8.3)
created:
12 years ago
visibility:
secret

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!