fork(1) download
copy 
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4.  
  5. const int MAX_LENGTH = 1000;
  6. const int TEN = 10;
  7. int freq[TEN];
  8. int freqN[TEN];
  9. int main() {
  10. 	char n[MAX_LENGTH];
  11. 	cin >> n;
  12. 	int length1 = strlen(n);
  13. 	//cout << length1 << " <- N\n" ;
  14. 	for (int i = 0; i < length1; ++i) {
  15. 		++freqN[n[i] - '0'];
  16. 	}
  17. 	for (int i = 0; i < TEN; ++i) {
  18. 		//cout << freqN[i]<< " " << i << "\n"; // frecventa la N
  19. 	}
  20. 	int desInN = 0, frecventa = 0;;
  21. 	for (int i = 0; i < TEN; ++i) {
  22. 		if (freqN[i] >= frecventa) {
  23. 			desInN = i;
  24. 			frecventa = freqN[i];
  25. 		}
  26. 	}
  27. 	//cout << n << " " << desInN << " "  << " <- Primul numar N + cea mai frecventa cifra sau cea mai mare \n";
  28.  
  29. 	char linie[MAX_LENGTH];
  30. 	cin.getline(linie, MAX_LENGTH);
  31. 	char numbCreate[MAX_LENGTH];
  32. 	int index = 0;
  33. 	while (cin.getline(linie, MAX_LENGTH)) {
  34. 		int length = strlen(linie);
  35. 		for (int i = 0; i < length; ++i){
  36. 			if (linie[i] >= '0' && linie[i] <= 57) {
  37. 				numbCreate[index] = linie[i];
  38. 				//cout << linie[i] <<"<-\n";
  39. 				//cout << linie[i] << " " << numbCreate[index] << " <-1\n";
  40. 				//numbCreate = numbCreate * TEN + linie[i] - 48;
  41. 				++freq[numbCreate[index] - '0'];
  42. 				//cout << numbCreate << " \n";
  43. 				++index;
  44. 			}
  45. 		}
  46.       //  cout << linie << " <- LINIE\n";
  47. 	}
  48. 	//cout << index << "<- INDEX\n";
  49. 	//cout << numbCreate << "<- Numar CREAT\n";
  50.  //cout << "\n";
  51. 	// n = 12342
  52. 	// nrNou = 4013589
  53. 	int freqInNou = 0, aparitii = 0;
  54. 	for (int i = 0; i < TEN; ++i) {
  55. 		if (freq[i] >= aparitii) {
  56. 			aparitii = freq[i];
  57. 			freqInNou = i;
  58. 		}
  59. 	} // 
  60. 	 for (int i = 0; i < TEN; ++i) {
  61. 		//cout << freq[i]<< " " << i << "\n"; // lfrecventa la numerul creat
  62. 	}
  63. 	//cout << numbCreate << " " << freqInNou  << "<- al doilea numar cel creat + cea mai frecventa cifra sau cea mai mare  \n";
  64. 	char newNN[MAX_LENGTH], reverseN[MAX_LENGTH];
  65. 	int aux = length1; 
  66. 	 // index = 89;
  67.  
  68. 	 for (int i = 0; i < TEN; ++i) {
  69. 	 	//cout << freqN[n[i]] <<"  "; 
  70.  	//	cout << freqN[i] <<" "; // aparitiile cifrelor din N
  71.  }
  72.  
  73. 	 //cout << freqN[n[0] - 48] << freqN[n[1] - 48] << freqN[n[2] - 48];
  74. //	 cout << numbCreate<< "<- ";
  75. 	 //for(int i = 0; i < TEN; ++i)  {
  76. 	 //	cout << freq[i] <<" ";
  77. 	// }
  78. //	cout << numbCreate <<"<- ";
  79. 	for ( int i = 0; i < length1; ++i) { // 1234
  80. //	cout << freqN[n[i] - '0'] <<"  " << n[i] <<" \n";
  81. 		for (int j = 0; j < index; ++j) { // 40432991
  82. 		//cout << freqN[j] << " "  << j << "\n"; //<< freqN[i] <<"\n"; 
  83. 			//cout << n[i] <<" " << numbCreate[j]   << " " <<i<<"<- \n"; // ar trebui sa se afiseze noul numar la fel ca N
  84. 			if (n[i] == numbCreate[j] && freqN[n[i] - '0'] != 0 && freq[numbCreate[j] - '0'] != 0) {
  85. 				newNN[aux - 1] = n[i];
  86. 				//cout << newNN[aux - 1] <<" " << aux <<"<- \n"; // ar trebui sa se afiseze noul numar la fel ca N
  87. 				--freqN[n[i] - '0'];
  88. 				--freq[numbCreate[j] - '0'];
  89. 				--aux;
  90. 				j = index;
  91. 			}
  92. 			//
  93. 		}
  94. 		//cout << "\n";
  95. 	}
  96. 	//cout << newNN;
  97. 	//cout << aux; // AUX-> Este 0
  98. 	for (int i = 0; i < TEN; ++i) {
  99.  	//	cout << freqN[i] <<" "; // aparitiile cifrelor din N dupa formarea lui al 2 lea N
  100.  }
  101.  for (int i = 0; i < length1; ++i) {
  102.  //	cout << newNN[i] <<" " << i << "\n";
  103.  }
  104. ///	cout << newNN << " " << n;
  105. 	int flag = 1;
  106. 	aux = length1;
  107. 	for (int i = 0, j = length1 - 1; i < aux; ++i, --j) {
  108. 	//	cout << newNN[i] <<" \n";
  109. 		//cout << newNN[j] << " " << i << " " << n[i] <<"\n";
  110. 		if (newNN[j] != n[i]) {
  111. 		//	cout << reverseN[j] << "<> " << i << " " << n[i] <<"\n";
  112. 			flag = 0;
  113. 		}
  114. 	}
  115. 	cout << flag << "<- FLAG " << "\n";
  116. 	if (flag == 1) { // strcmp(newNN , n) == 0
  117.  
  118. 		cout <<  newNN << "";; ;
  119. 	} else  {
  120. 		cout << desInN << " " << freqInNou;
  121. 	}  
  122.  
  123. 	//cout << desInN << " " << freqInNou; 
  124. 	//cout << numbCreate <<" \n" << newNN << " \n" << n;
  125. 	return 0;
  126. }
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin
copy 
42323
2 lei mititei
se-joaca!
2 in 3-44355 copaci
stdout
copy 
1<- FLAG 
32324
https://ideone.com/EOaQix
language:
C++14 (gcc 8.3)
created:
1 day 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!