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;
  21. 	for (int i = 0; i < length; ++i) {
  22. 		if (isWord(a[i]) == 1) {
  23. 			letter = 1;
  24. 		} else if (letter == 1) {
  25. 			++words;
  26. 			letter = 0;
  27. 		}
  28. 		b[i + 1] = a[i];
  29. 	}	
  30. 	if(letter == 1) {
  31. 		++words;
  32. 	}
  33.  
  34. 	int y = 0, pos2 = 0;;
  35. 	for (int i = 1; i < length + 1; ++i) {
  36. 		int cntr = 0;
  37. 		for (int j = i; j < length + 1 && b[i] == b[j]; ++j) {
  38.  
  39. 			if (b[i] == b[j]) {
  40. 				++cntr;
  41. 				//cout << cntr << " " << j <<"\n";
  42. 				//i = cntr + 1;
  43. 				cout << i <<" " << j <<"\n";
  44. 			} else if (b[i] != b[j] && cntr > y) {
  45. 				y = cntr;
  46. 				pos2 = i - 1;
  47. 				i = y + 1;
  48. 				cout << "DA" << "\n";
  49. 			}
  50.  
  51. 		}
  52.  
  53. 	}
  54. 	cout << y << " " << pos2;
  55.  
  56.  
  57. 	int matches = 0, counterMatches = 1;
  58. 	for (int i = 2; i < length + 1; ++i) {
  59. 		if (b[1] == b[i] && b[1] == b[length - (i - 1) + 1]) {
  60. 			++counterMatches;
  61. 			//cout << counterMatches <<" " <<b[1] << " "<< b[length - (i - 1) + 1] <<" ";
  62. 		//	cout << i <<" " << length - i  + 1 <<"\n";
  63. 		}
  64. 		if (b[1] != b[i] && counterMatches >= matches) {
  65. 			matches = counterMatches;
  66. 			counterMatches = 1;
  67. 		}
  68. 	}
  69. 	//cout << matches;
  70. 	//cout << words <<"\n";
  71. 	int posA = 1, posB = 1;
  72. 	int counter = 0;
  73. 	for (int i = 1; i < length / 2 + 1; ++i) {  //cout << i << " " << length - i + 1 <<"\n";
  74.  
  75. 		if (b[i] == b[length - i + 1]) {
  76. 			++counter;
  77. 			posB = i;
  78. 		} else if (b[i] != b[length - i + 1]) {
  79. 			posA = i - counter;
  80. 			counter = 0;
  81. 		}
  82. 	}
  83.  
  84. 	/*
  85. 	cout << b[i]<< " " << b[length - i + 1]<<" ";
  86. 	cout << i << " " << length - i + 1 <<"\n";
  87. 	*/
  88.  
  89. 	for ( int i = 0; i < length; ++i) {
  90. 		if ((a[i] > 'A' || a[i] < 'Z') &&  (a[i] == a[length - i])) { //AAAa123BCDAAA!@#zxswAA
  91.  
  92. 		}
  93. 	}
  94.  
  95. //	cout << length /2;
  96. 	//cout << a << "\n"<< length;
  97. 	return 0; 
  98. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
BBBALIZILABBB
stdout
copy 
1 1
1 2
1 3
2 2
2 3
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 10
11 11
11 12
11 13
12 12
12 13
13 13
0 0
https://ideone.com/BS6uMD
language:
C++14 (gcc 8.3)
created:
10 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!