#include<bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef pair<lli, int> pli;
typedef pair<int, lli> pil;
string s;
lli wyn=0;
int pom=-1;
bool sam[30];
int main()
{
boost;
sam[0]=1;
sam['e'-'a']=1;
sam['i'-'a']=1;
sam['o'-'a']=1;
sam['u'-'a']=1;
sam['y'-'a']=1;
cin>>s;
int n=s.size();
for(int i=2;i<n;i++)
{
if((sam[s[i-2]-'a']==sam[s[i-1]-'a'])&&(sam[s[i-1]-'a']==sam[s[i]-'a']))pom=i-2;
wyn+=(pom+1);
}
cout<<wyn<<"\n";
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 | #include<bits/stdc++.h> using namespace std; #define st first #define nd second #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() #define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) typedef long long lli; typedef pair<int, int> pii; typedef pair<lli, lli> pll; typedef pair<lli, int> pli; typedef pair<int, lli> pil; string s; lli wyn=0; int pom=-1; bool sam[30]; int main() { boost; sam[0]=1; sam['e'-'a']=1; sam['i'-'a']=1; sam['o'-'a']=1; sam['u'-'a']=1; sam['y'-'a']=1; cin>>s; int n=s.size(); for(int i=2;i<n;i++) { if((sam[s[i-2]-'a']==sam[s[i-1]-'a'])&&(sam[s[i-1]-'a']==sam[s[i]-'a']))pom=i-2; wyn+=(pom+1); } cout<<wyn<<"\n"; return 0; } |
English