#include <bits/stdc++.h> using namespace std; inline bool Samogloska(char x) { switch(x){ case 'a': case 'e': case 'i': case 'o': case 'u': case 'y': return true; default: return false; } } int main() { ios_base::sync_with_stdio(false); string s; cin>>s; long long T, p, q, sp_c = 0, sa_c = 0, n, last = 0; unsigned long long suma = 0; bool samogloska = false; if(Samogloska(s[s.size()-1])) s+="x"; else s+="y"; for(int i = 0; i < s.size(); i++) { switch(s[i]){ case 'a': case 'e': case 'i': case 'o': case 'u': case 'y': samogloska = true; break; default: samogloska = false; } if(sp_c >= 3 && samogloska) { n = sp_c -2; T = (n*(n+1))/2LL; q = (long long)(s.size()-i-1); p = static_cast<long long>(i-sp_c-last); suma += T + n*(p+q) + p*q; last = i-2; } else if(sa_c >= 3 && !samogloska) { n = sa_c -2; T = (n*(n+1))/2LL; q = (long long)(s.size()-i-1); p = static_cast<long long>(i-sa_c-last); suma += T + n*(p+q) + p*q; last = i-2; } if(samogloska) {sa_c++; sp_c = 0;} else { sp_c++; sa_c = 0; } } cout << suma << 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 | #include <bits/stdc++.h> using namespace std; inline bool Samogloska(char x) { switch(x){ case 'a': case 'e': case 'i': case 'o': case 'u': case 'y': return true; default: return false; } } int main() { ios_base::sync_with_stdio(false); string s; cin>>s; long long T, p, q, sp_c = 0, sa_c = 0, n, last = 0; unsigned long long suma = 0; bool samogloska = false; if(Samogloska(s[s.size()-1])) s+="x"; else s+="y"; for(int i = 0; i < s.size(); i++) { switch(s[i]){ case 'a': case 'e': case 'i': case 'o': case 'u': case 'y': samogloska = true; break; default: samogloska = false; } if(sp_c >= 3 && samogloska) { n = sp_c -2; T = (n*(n+1))/2LL; q = (long long)(s.size()-i-1); p = static_cast<long long>(i-sp_c-last); suma += T + n*(p+q) + p*q; last = i-2; } else if(sa_c >= 3 && !samogloska) { n = sa_c -2; T = (n*(n+1))/2LL; q = (long long)(s.size()-i-1); p = static_cast<long long>(i-sa_c-last); suma += T + n*(p+q) + p*q; last = i-2; } if(samogloska) {sa_c++; sp_c = 0;} else { sp_c++; sa_c = 0; } } cout << suma << endl; return 0; } |