fork(2) download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_LENGTH  = 20;
  5. const int TEN = 10;
  6. int freq[MAX_LENGTH];
  7.  
  8.  
  9. int main() {
  10. 	int n, v[MAX_LENGTH + 1];
  11. 	cin >> n;
  12. 	int array[MAX_LENGTH + 1] = {0};
  13. 	int freqDig = 0, aparitii = 0, areEqual = 1;
  14. 	for (int i = 1; i <= n; ++i) {
  15. 		cin >> v[i];
  16.  
  17. 		if (i > 1 && v[i] != v[i- 1] ||  n == 1) {
  18. 				//cout << v[i] <<"<- " <<i << "\n";
  19. 			areEqual = 0;
  20. 		}
  21. 		int copyEl = v[i];
  22. 			if (copyEl < 0) {
  23. 			copyEl = -copyEl;
  24. 		}
  25. 		//cout << copyEl <<"<- ";
  26. 		while (copyEl) {
  27. 			++freq[copyEl % TEN];
  28. 			if (freq[copyEl % TEN] > aparitii) {
  29. 				aparitii = freq[copyEl % TEN];
  30. 				freqDig = copyEl % TEN;
  31. 			}
  32. 			copyEl /= TEN;
  33. 		}
  34. 		for (int i = 0; i < TEN; ++i) {
  35. 			cout << freq[i] << " ";
  36. 		}
  37. 		cout << "(" <<i<< ")\n";
  38. 	}
  39. //	cout << areEqual <<"<-areEqual " << freqDig <<"<-freqDig \n";
  40. 	//, 
  41.  
  42.  //if (v[i] >= bigNo && v[i] != 0) {
  43. 		//	bigNo = v[i];
  44. 	//	}
  45.  
  46. 	int index = 0;
  47. 	for (int i = 1; i <= n; ++i) {
  48. 		int copyVal = v[i];
  49. 		int freqColor[MAX_LENGTH] = {0};
  50. 		while (copyVal) {
  51. 			++freqColor[copyVal % TEN];
  52. 			copyVal /= TEN;
  53. 		}
  54.  
  55. 	//	cout << freqColor[freqDig] <<"  ";
  56. 		int aux = 0, bigNo = 0;
  57. 		for (int i = 0; i < TEN; ++i) {
  58. 			if (freqColor[i] >= aux && freqColor[i] != 0) {
  59. 				//cout << freqColor[i] <<" " << i << " \n";
  60. 				aux = freqColor[i];
  61. 				bigNo = i;
  62. 			}
  63.  
  64. 			}
  65. 			//cout << bigNo <<"<-BigNO" << " ->" << i << " i<-";
  66. 		if (bigNo == freqDig) {
  67. 		//	cout << v[i] <<" \n";
  68. 			++index;
  69. 		}
  70. 	}
  71. 	if (index == 0 || areEqual == 1) {
  72. 		cout << "NU AVEM!"; 
  73. 	}
  74. 	return 0;
  75. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
20
1112 1113 1114 1115 1116 1117 1118 1119 1110 11122 -1113 -1114 11133 11144 11155 11166 11177 11188 11199 111000
stdout
copy 
0 3 1 0 0 0 0 0 0 0 (1)
0 6 1 1 0 0 0 0 0 0 (2)
0 9 1 1 1 0 0 0 0 0 (3)
0 12 1 1 1 1 0 0 0 0 (4)
0 15 1 1 1 1 1 0 0 0 (5)
0 18 1 1 1 1 1 1 0 0 (6)
0 21 1 1 1 1 1 1 1 0 (7)
0 24 1 1 1 1 1 1 1 1 (8)
1 27 1 1 1 1 1 1 1 1 (9)
1 30 3 1 1 1 1 1 1 1 (10)
1 33 3 2 1 1 1 1 1 1 (11)
1 36 3 2 2 1 1 1 1 1 (12)
1 39 3 4 2 1 1 1 1 1 (13)
1 42 3 4 4 1 1 1 1 1 (14)
1 45 3 4 4 3 1 1 1 1 (15)
1 48 3 4 4 3 3 1 1 1 (16)
1 51 3 4 4 3 3 3 1 1 (17)
1 54 3 4 4 3 3 3 3 1 (18)
1 57 3 4 4 3 3 3 3 3 (19)
4 60 3 4 4 3 3 3 3 3 (20)
https://ideone.com/NCFJnQ
language:
C++14 (gcc 8.3)
created:
6 hours 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!