fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. bool isPrime(int digit) {
  5. 	if (digit < 0) {
  6. 		digit = -digit;
  7. 	}
  8. 	return digit == 2 || digit == 3 || digit == 5 || digit == 7;
  9. }
  10.  
  11. int main() {
  12. 	int n;
  13. 	cin >> n;
  14. 	int primeIndex = 0, primeDigitsCount = 0, primeNo = -2000000001;
  15. 	for (int i = 1; i <= n; ++i) {
  16. 		int no, digitsCount = 0;
  17. 		cin >> no;
  18. 		int cpyNo = no;
  19. 		while (cpyNo) {
  20. 			if (isPrime(cpyNo % 10)) {
  21. 				++digitsCount;
  22. 			} else {
  23. 			 	digitsCount = 0;
  24. 			 	cpyNo = -1;
  25. 			 	break;
  26. 			 }
  27. 			cpyNo /= 10;
  28. 		}
  29. 		cout << no << "," << digitsCount << "," << primeIndex << " ";
  30. 		if (cpyNo != -1 && no && (digitsCount > primeDigitsCount || (digitsCount == primeDigitsCount && no >= primeNo))) {
  31. 			primeIndex = i;
  32. 			primeDigitsCount = digitsCount;
  33. 			primeNo = no;
  34. 		}
  35.  
  36. 	}
  37. 	//cout << "\n";
  38. 	if (primeIndex) {
  39. 		cout << primeIndex;
  40. 	} else {
  41. 		cout << "AJUNGE LA DESTINATIE!";
  42. 	}
  43. 	return 0;
  44. }
Success #stdin #stdout 0.01s 5240KB
comments (?)
stdin
copy 
1
0
stdout
copy 
0,0,0 AJUNGE LA DESTINATIE!
https://ideone.com/XzjpKI
language:
C++ (gcc 8.3)
created:
278 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!