fork(1) download
copy 
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4.  
  5. const int MAX_LENGTH = 1000;
  6.  
  7. int isWord (char x) {
  8. 	if ((x >= 'A' && x <= 'Z') || (x >= 'a' && x <= 'z')) {
  9. 		return 1;
  10. 	}
  11. 	return 0;
  12. }
  13.  
  14.  
  15. int main() {
  16. 	char a[MAX_LENGTH], b[MAX_LENGTH + 1];
  17. 	cin >> a;
  18. 	int length = strlen(a);
  19.  
  20. 	int words = 0, letter = 0, capitalLetter = 0;
  21. 	for (int i = 0; i < length; ++i) {
  22. 		if (a[i] >= 'A' && a[i] <= 'Z') {
  23. 			++capitalLetter;
  24. 		}
  25. 		if (isWord(a[i]) == 1) {
  26. 			letter = 1;
  27. 		} else if (letter == 1) {
  28. 			++words;
  29. 			letter = 0;
  30. 		}
  31. 		b[i + 1] = a[i];
  32. 	}	
  33. 	if(letter == 1) {
  34. 		++words;
  35. 	}
  36. 	//cout << length << " " << capitalLetter <<"<----\n";
  37.  //---------> Am numarat cuvintele <-----------------------
  38. 	int findMatch = 0,cntr = 0, pos2 = 0;;
  39. 	for (int i = 1; i < length + 1; ++i) {
  40. 		int  flag = 1;
  41. 		for (int j = i; j < length + 1 && flag == 1; ++j) {
  42.  
  43. 			if (b[i] == b[j] && (b[i] >= 'A' && b[i] <= 'Z')) {
  44. 				++cntr;
  45. 				//cout << cntr << " " << j <<"\n";
  46. 				//i = cntr + 1;
  47. 				//cout << i <<"<->" << j  <<"<->"<< cntr <<"\n";
  48. 			} else if (b[i] != b[j]) { // && cntr > findMatch
  49. 				flag = 0;
  50. 				if (cntr > findMatch) {
  51. 					findMatch = cntr; // 3, 
  52. 						pos2 = j ;
  53. 				}
  54. 				//findMatch = cntr; // 3, 
  55. 			//	pos2 = j ;
  56. 				//cout  << i << " " << j << " " << cntr<< " Nu-i identic" << "\n";
  57. 				i = j - 1;
  58. 				cntr = 0;
  59. 			} 
  60. 			if ((cntr > findMatch && j == length) ||  j == length ) {
  61.  
  62. 				if (cntr > findMatch) {
  63. 					findMatch = cntr;
  64. 					pos2 = j;// 3, 
  65. 				}
  66. 				i = j;
  67. 			//	cout << "DAAAA\n";
  68. 			}
  69. 		}
  70. 	}
  71. //	cout << findMatch << " " << pos2 << "\n";
  72.  int isPrime = 1;
  73.  for (int div = 2; div < findMatch; ++div) {
  74.  	if (findMatch % div == 0) {
  75.  		isPrime = 0;
  76.  	}
  77.  }
  78.  if (findMatch == 1) {
  79.  	isPrime = 0;
  80.  }
  81.  
  82.  if (isPrime == 1 && capitalLetter == length) {
  83.  	cout << pos2 - findMatch <<" " << pos2 - 1;
  84.  } else  {
  85.  	cout << words;
  86.  }
  87.  
  88. 	for ( int i = pos2 ; i < length + 1; ++i) {
  89. 	//	cout << b[i] <<" ";
  90. 	}
  91. 	//cout << pos2 << " " << pos2 + findMatch - 1;
  92.  
  93. /*	
  94. 	int matches = 0, counterMatches = 1;
  95. 	for (int i = 2; i < length + 1; ++i) {
  96. 		if (b[1] == b[i] && b[1] == b[length - (i - 1) + 1]) {
  97. 			++counterMatches;
  98. 			//cout << counterMatches <<" " <<b[1] << " "<< b[length - (i - 1) + 1] <<" ";
  99. 		//	cout << i <<" " << length - i  + 1 <<"\n";
  100. 		}
  101. 		if (b[1] != b[i] && counterMatches >= matches) {
  102. 			matches = counterMatches;
  103. 			counterMatches = 1;
  104. 		}
  105. 	}
  106. 	//cout << matches;
  107. 	//cout << words <<"\n";
  108. 	int posA = 1, posB = 1;
  109. 	int counter = 0;
  110. 	for (int i = 1; i < length / 2 + 1; ++i) {  //cout << i << " " << length - i + 1 <<"\n";
  111.  
  112. 		if (b[i] == b[length - i + 1]) {
  113. 			++counter;
  114. 			posB = i;
  115. 		} else if (b[i] != b[length - i + 1]) {
  116. 			posA = i - counter;
  117. 			counter = 0;
  118. 		}
  119. 	}
  120.  
  121.  
  122. 	cout << b[i]<< " " << b[length - i + 1]<<" ";
  123. 	cout << i << " " << length - i + 1 <<"\n";
  124.  
  125.  
  126. 	for ( int i = 0; i < length; ++i) {
  127. 		if ((a[i] > 'A' || a[i] < 'Z') &&  (a[i] == a[length - i])) { //AAAa123BCDAAA!@#zxswAA
  128.  
  129. 		}
  130. 	}
  131.  
  132. 	*/
  133. //	cout << length /2;
  134. 	//cout << a << "\n"<< length;
  135. 	return 0; 
  136. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
BBBALIZILABBB

ASZXDCFFFFFSXCDVGTGNGTHY
stdout
copy 
1 3
https://ideone.com/Sespbl
language:
C++14 (gcc 8.3)
created:
4 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!