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 << n << " <- N\n" ;
  14. 	for (int i = 0; i < length1; ++i) {
  15. 		++freqN[n[i] - 48];
  16. 	}
  17. 	//for (int i = 0; i < TEN; ++i) {
  18. 	//	cout << freqN[i]<< " " << i << "\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] >= 48 && 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] - 48];
  42. 				//cout << numbCreate << " \n";
  43. 				++index;
  44. 			}
  45. 		}
  46.         //cout << linie << " <- LINIE\n";
  47. 	}
  48. //	cout << index << "<- INDEX\n";
  49.  
  50. 	// n = 12342
  51. 	// nrNou = 4013589
  52. 	int freqInNou = 0, aparitii = 0;
  53. 	for (int i = 0; i < TEN; ++i) {
  54. 		if (freq[i] >= aparitii) {
  55. 			aparitii = freq[i];
  56. 			freqInNou = i;
  57. 		}
  58. 	}
  59. 	//cout << numbCreate << " " << freqInNou  << "<- al doilea numar cel creat + cea mai frecventa cifra sau cea mai mare  \n";
  60. 	char newNN[MAX_LENGTH], reverseN[MAX_LENGTH];
  61. 	int aux = 0, aux2 = length1 ;;
  62. 	for ( int i = 0; i < length1; ++i) { // 1234
  63. 		for (int j = 0; j < index; ++j) { // 40432991
  64. 			if (n[i] == numbCreate[j] && freq[i] != 0) {
  65.  
  66. 				newNN[aux] = n[i];
  67. 			//	cout << newNN[aux] <<" " << aux <<" \n";
  68. 				--freq[i];
  69. 				++aux;
  70. 			}
  71. 			//cout << "\n";
  72. 		}
  73. 		reverseN[aux2 - 1] = n[i];
  74. 		--aux2;
  75. 	}
  76. 	int flag = 1;
  77. 	for (int i = 0, j = aux - 1; i < aux; ++i, --j) {
  78. 		//cout << reverseN[i] <<"";
  79. 	//	cout << reverseN[j] << " " << i << " " << n[i] <<"\n";
  80. 		if (reverseN[j] != n[i]) {
  81. 		//	cout << reverseN[j] << "<> " << i << " " << n[i] <<"\n";
  82. 			flag = 0;
  83. 		}
  84. 	}
  85. 	//cout << flag << " " << n << "\n";
  86. 	if (flag == 1) { // strcmp(newNN , n) == 0
  87.  
  88. 		cout <<  reverseN;; ;
  89. 	} else  {
  90. 		cout << desInN << " " << freqInNou;
  91. 	}
  92.  
  93. 	//cout << desInN << " " << freqInNou; 
  94. 	//cout << numbCreate <<" \n" << newNN << " \n" << n;
  95. 	return 0;
  96. }
  97.  
Success #stdin #stdout 0.01s 5328KB
comments (?)
stdin
copy 
4232
2 lei mititei
se-joaca! in 3-4 copaci
stdout
copy 
2 4
https://ideone.com/8P2yVj
language:
C++14 (gcc 8.3)
created:
4 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!