fork 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] = {0};
  32. 	int index = 0;
  33. 	while (cin.getline(linie, MAX_LENGTH)) {
  34. 		//cout << linie <<"<-\n";
  35. 		int length = strlen(linie);
  36. 		for (int i = 0; i < length; ++i){
  37. 			//cout << linie[i] <<"<-";
  38. 			if (linie[i] >= '0' && linie[i] <= '9') {
  39. 				numbCreate[index] = linie[i];
  40. 				//cout << linie[i] <<"<-\n";
  41. 				//cout << linie[i] << " " << numbCreate[index] << " <-1\n";
  42. 				//numbCreate = numbCreate * TEN + linie[i] - 48;
  43. 				++freq[numbCreate[index] - '0'];
  44. 				//cout << numbCreate << " \n";
  45. 				++index;
  46. 			}
  47. 		}
  48.       //  cout << linie << " <- LINIE\n";
  49. 	}
  50. 	//cout << index << "<- INDEX\n";
  51. 	//cout << numbCreate << "<- Numar CREAT\n";
  52.  //cout << "\n";
  53. 	// n = 12342
  54. 	// nrNou = 4013589
  55. 	int freqInNou = 0, aparitii = 0;
  56. 	for (int i = 0; i < TEN; ++i) {
  57. 		if (freq[i] >= aparitii) {
  58. 			aparitii = freq[i];
  59. 			freqInNou = i;
  60. 		}
  61. 	} // 
  62. 	 for (int i = 0; i < TEN; ++i) {
  63. 		//cout << freq[i]<< " " << i << "\n"; // lfrecventa la numerul creat
  64. 	}
  65. //	cout << numbCreate << " " << freqInNou  << "<- al doilea numar cel creat + cea mai frecventa cifra sau cea mai mare  \n";
  66. 	char newNN[MAX_LENGTH] = {0}, reverseN[MAX_LENGTH];
  67. 	int aux = length1; 
  68. 	 // index = 89;
  69.  
  70. 	 for (int i = 0; i < TEN; ++i) {
  71. 	 	//cout << freqN[n[i]] <<"  "; 
  72.  	//	cout << freqN[i] <<" "; // aparitiile cifrelor din N
  73.  }
  74.  
  75. 	 //cout << freqN[n[0] - 48] << freqN[n[1] - 48] << freqN[n[2] - 48];
  76. //	 cout << numbCreate<< "<- ";
  77. 	 //for(int i = 0; i < TEN; ++i)  {
  78. 	 //	cout << freq[i] <<" ";
  79. 	// }
  80. //	cout << numbCreate <<"<- ";
  81. 	for ( int i = 0; i < length1; ++i) { // 1234
  82. //	cout << freqN[n[i] - '0'] <<"  " << n[i] <<" \n";
  83. 		for (int j = 0; j < index; ++j) { // 40432991
  84. 		//cout << freqN[j] << " "  << j << "\n"; //<< freqN[i] <<"\n"; 
  85. 			//cout << n[i] <<" " << numbCreate[j]   << " " <<i<<"<- \n"; // ar trebui sa se afiseze noul numar la fel ca N
  86. 			if (n[i] == numbCreate[j] && freqN[n[i] - '0'] != 0 && freq[numbCreate[j] - '0'] != 0) {
  87. 				newNN[aux - 1] = n[i];
  88. 				//cout << newNN[aux - 1] <<" " << aux <<"<- \n"; // ar trebui sa se afiseze noul numar la fel ca N
  89. 				--freqN[n[i] - '0'];
  90. 				--freq[numbCreate[j] - '0'];
  91. 				--aux;
  92. 				j = index;
  93. 			}
  94. 			//
  95. 		}
  96. 		//cout << "\n";
  97. 	}
  98. 	//cout << newNN;
  99. 	//cout << aux; // AUX-> Este 0
  100. 	for (int i = 0; i < TEN; ++i) {
  101.  	//	cout << freqN[i] <<" "; // aparitiile cifrelor din N dupa formarea lui al 2 lea N
  102.  }
  103.  for (int i = 0; i < length1; ++i) {
  104.  //	cout << newNN[i] <<" " << i << "\n";
  105.  }
  106. //	cout << newNN << " " << n;
  107. 	int flag = 1;
  108. 	aux = length1;
  109. 	for (int i = 0, j = length1 - 1; i < aux; ++i, --j) {
  110. 	//	cout << newNN[i] <<" \n";
  111. 		//cout << newNN[j] << " " << i << " " << n[i] <<"\n";
  112. 		if (newNN[j] != n[i]) {
  113. 		//	cout << reverseN[j] << "<> " << i << " " << n[i] <<"\n";
  114. 			flag = 0;
  115. 		}
  116. 	}
  117. 	//cout << newNN[1] << "<- FLAG " << "\n";
  118. 	if (flag == 1) { // strcmp(newNN , n) == 0
  119. 		if (newNN[0] == '0') {
  120. 			for (int i = 1; i < length1; ++i) {
  121. 				cout <<  newNN[i] << ",";
  122. 			}
  123. 		} else {
  124. 			cout <<  newNN << ".";; ;
  125. 		}
  126. 		//cout <<  newNN << "";; ;
  127. 	} else  {
  128. 		cout << desInN << " " << freqInNou;
  129. 	}  
  130.  
  131. 	//cout << desInN << " " << freqInNou; 
  132. 	//cout << numbCreate <<" \n" << newNN << " \n" << n;
  133. 	return 0;
  134. }
Success #stdin #stdout 0.01s 5316KB
comments (?)
stdin
copy 
70
112233445566778899
stdout
copy 
7 9
https://ideone.com/nKlmYr
language:
C++14 (gcc 8.3)
created:
11 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!