#include <iostream> #include <string> #include <map> using namespace std; int samogloskaCzySpolgloska[26]; void start() { samogloskaCzySpolgloska['a' - 'a'] = 1; samogloskaCzySpolgloska['b' - 'a'] = 0; samogloskaCzySpolgloska['c' - 'a'] = 0; samogloskaCzySpolgloska['d' - 'a'] = 0; samogloskaCzySpolgloska['e' - 'a'] = 1; samogloskaCzySpolgloska['f' - 'a'] = 0; samogloskaCzySpolgloska['g' - 'a'] = 0; samogloskaCzySpolgloska['h' - 'a'] = 0; samogloskaCzySpolgloska['i' - 'a'] = 1; samogloskaCzySpolgloska['j' - 'a'] = 0; samogloskaCzySpolgloska['k' - 'a'] = 0; samogloskaCzySpolgloska['l' - 'a'] = 0; samogloskaCzySpolgloska['m' - 'a'] = 0; samogloskaCzySpolgloska['n' - 'a'] = 0; samogloskaCzySpolgloska['o' - 'a'] = 1; samogloskaCzySpolgloska['p' - 'a'] = 0; samogloskaCzySpolgloska['q' - 'a'] = 0; samogloskaCzySpolgloska['r' - 'a'] = 0; samogloskaCzySpolgloska['s' - 'a'] = 0; samogloskaCzySpolgloska['t' - 'a'] = 0; samogloskaCzySpolgloska['u' - 'a'] = 1; samogloskaCzySpolgloska['v' - 'a'] = 0; samogloskaCzySpolgloska['w' - 'a'] = 0; samogloskaCzySpolgloska['x' - 'a'] = 0; samogloskaCzySpolgloska['y' - 'a'] = 1; samogloskaCzySpolgloska['z' - 'a'] = 0; } int main() { start(); string s; cin >> s; long long int inRow = 1; long long int starter = 0; long long int ender = 0; long long int rightSide = 0; long long int sum = 0; bool found = false; //cout << "1"; for(int i = 1; i < s.length(); i++) { if(samogloskaCzySpolgloska[s[i] - 'a'] == samogloskaCzySpolgloska[s[i - 1] - 'a']) { //cout << s[i - 1] << " = " << s[i] << endl; inRow++; } else { //cout << s[i - 1] << " != " << s[i] << endl; inRow = 1; } if(inRow >= 3 && found == false) { starter = i - 2; ender = i; rightSide = -1; found = true; //cout << ">1" << endl; } else if((inRow >= 3) && found == true) { //cout << ">2" << endl; //cout << starter << " " << ender << endl; sum += (starter + 1) * (rightSide + 1); rightSide = -1; starter = i - 2; ender = i; } if(i == s.length() - 1 && found == true) { //cout << ">3" << endl; //cout << starter << " " << ender << endl; sum += (starter + 1) * (s.length() - ender); } if(found == true) { rightSide++; } //cout << inRow; } cout << sum << endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 | #include <iostream> #include <string> #include <map> using namespace std; int samogloskaCzySpolgloska[26]; void start() { samogloskaCzySpolgloska['a' - 'a'] = 1; samogloskaCzySpolgloska['b' - 'a'] = 0; samogloskaCzySpolgloska['c' - 'a'] = 0; samogloskaCzySpolgloska['d' - 'a'] = 0; samogloskaCzySpolgloska['e' - 'a'] = 1; samogloskaCzySpolgloska['f' - 'a'] = 0; samogloskaCzySpolgloska['g' - 'a'] = 0; samogloskaCzySpolgloska['h' - 'a'] = 0; samogloskaCzySpolgloska['i' - 'a'] = 1; samogloskaCzySpolgloska['j' - 'a'] = 0; samogloskaCzySpolgloska['k' - 'a'] = 0; samogloskaCzySpolgloska['l' - 'a'] = 0; samogloskaCzySpolgloska['m' - 'a'] = 0; samogloskaCzySpolgloska['n' - 'a'] = 0; samogloskaCzySpolgloska['o' - 'a'] = 1; samogloskaCzySpolgloska['p' - 'a'] = 0; samogloskaCzySpolgloska['q' - 'a'] = 0; samogloskaCzySpolgloska['r' - 'a'] = 0; samogloskaCzySpolgloska['s' - 'a'] = 0; samogloskaCzySpolgloska['t' - 'a'] = 0; samogloskaCzySpolgloska['u' - 'a'] = 1; samogloskaCzySpolgloska['v' - 'a'] = 0; samogloskaCzySpolgloska['w' - 'a'] = 0; samogloskaCzySpolgloska['x' - 'a'] = 0; samogloskaCzySpolgloska['y' - 'a'] = 1; samogloskaCzySpolgloska['z' - 'a'] = 0; } int main() { start(); string s; cin >> s; long long int inRow = 1; long long int starter = 0; long long int ender = 0; long long int rightSide = 0; long long int sum = 0; bool found = false; //cout << "1"; for(int i = 1; i < s.length(); i++) { if(samogloskaCzySpolgloska[s[i] - 'a'] == samogloskaCzySpolgloska[s[i - 1] - 'a']) { //cout << s[i - 1] << " = " << s[i] << endl; inRow++; } else { //cout << s[i - 1] << " != " << s[i] << endl; inRow = 1; } if(inRow >= 3 && found == false) { starter = i - 2; ender = i; rightSide = -1; found = true; //cout << ">1" << endl; } else if((inRow >= 3) && found == true) { //cout << ">2" << endl; //cout << starter << " " << ender << endl; sum += (starter + 1) * (rightSide + 1); rightSide = -1; starter = i - 2; ender = i; } if(i == s.length() - 1 && found == true) { //cout << ">3" << endl; //cout << starter << " " << ender << endl; sum += (starter + 1) * (s.length() - ender); } if(found == true) { rightSide++; } //cout << inRow; } cout << sum << endl; return 0; } |