#include<bits/stdc++.h> //#include<fstream> using namespace std; long long n, lt, wyn, w, p, id, lewa, prawa; string s; deque < int > k; //ifstream WE; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); //WE.open("pol0.txt"); cin>>s; //WE>>s; n=s.size(); for(int i=2; i<s.size(); i++) { if((s[i]=='a' || s[i]=='e' || s[i]=='i' || s[i]=='o' || s[i]=='u' || s[i]=='y') && (s[i-1]=='a' || s[i-1]=='e' || s[i-1]=='i' || s[i-1]=='o' || s[i-1]=='u' || s[i-1]=='y') && (s[i-2]=='a' || s[i-2]=='e' || s[i-2]=='i' || s[i-2]=='o' || s[i-2]=='u' || s[i-2]=='y')) { lt++; k.push_back(i); } if(s[i]!='a' && s[i]!='e' && s[i]!='i' && s[i]!='o' && s[i]!='u' && s[i]!='y' && s[i-1]!='a' && s[i-1]!='e' && s[i-1]!='i' && s[i-1]!='o' && s[i-1]!='u' && s[i-1]!='y' && s[i-2]!='a' && s[i-2]!='e' && s[i-2]!='i' && s[i-2]!='o' && s[i-2]!='u' && s[i-2]!='y') { lt++; k.push_back(i); } } while(k.size()) { id=k.front(); lewa=id-p-1; prawa=n-id; k.pop_front(); wyn+=lewa*prawa; //cout<<id<<' '<<lewa<<' '<<prawa<<' '<<p<<endl; p=id-1; } cout<<wyn<<endl; }
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 | #include<bits/stdc++.h> //#include<fstream> using namespace std; long long n, lt, wyn, w, p, id, lewa, prawa; string s; deque < int > k; //ifstream WE; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); //WE.open("pol0.txt"); cin>>s; //WE>>s; n=s.size(); for(int i=2; i<s.size(); i++) { if((s[i]=='a' || s[i]=='e' || s[i]=='i' || s[i]=='o' || s[i]=='u' || s[i]=='y') && (s[i-1]=='a' || s[i-1]=='e' || s[i-1]=='i' || s[i-1]=='o' || s[i-1]=='u' || s[i-1]=='y') && (s[i-2]=='a' || s[i-2]=='e' || s[i-2]=='i' || s[i-2]=='o' || s[i-2]=='u' || s[i-2]=='y')) { lt++; k.push_back(i); } if(s[i]!='a' && s[i]!='e' && s[i]!='i' && s[i]!='o' && s[i]!='u' && s[i]!='y' && s[i-1]!='a' && s[i-1]!='e' && s[i-1]!='i' && s[i-1]!='o' && s[i-1]!='u' && s[i-1]!='y' && s[i-2]!='a' && s[i-2]!='e' && s[i-2]!='i' && s[i-2]!='o' && s[i-2]!='u' && s[i-2]!='y') { lt++; k.push_back(i); } } while(k.size()) { id=k.front(); lewa=id-p-1; prawa=n-id; k.pop_front(); wyn+=lewa*prawa; //cout<<id<<' '<<lewa<<' '<<prawa<<' '<<p<<endl; p=id-1; } cout<<wyn<<endl; } |