fork(1) download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_LENGTH = 100;
  5.  
  6. int main() {
  7. 	int n, v[MAX_LENGTH + 1], prime[MAX_LENGTH + 1];
  8. 	cin >> n;
  9. 	int index = 1; 
  10. 	for (int i = 1; i <= n; ++i) {
  11. 		cin >> v[i];
  12. 		int isPrime = 1, module = v[i];
  13. 		if (v[i] < 0) {
  14. 			module *= -1;
  15. 		}
  16. 		for (int divide = 2; divide < module && isPrime == 1; ++divide) {
  17. 			if (module % divide == 0) {
  18. 				isPrime = 0;
  19. 			}
  20. 		}
  21. 		if (isPrime == 1 && module > 1) {
  22. 			prime[index] = v[i];
  23. 			//cout << v[i] <<" ";
  24. 			++index;
  25. 		}
  26. 	}
  27. 	int sum = 0;
  28. 	for (int i = 1; i < index; ++i){
  29. 		sum += prime[i];
  30. 	//	cout << prime[i] <<" ";
  31. 	}
  32. 	cout << sum;
  33. 	return 0; 
  34. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
7
10 -2 2 8 17 -13 30
stdout
copy 
4
https://ideone.com/7JTr7f
language:
C++14 (gcc 8.3)
created:
8 days 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!