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
#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;
string c;

int main(){
	long long int  sum = 0;
	long long int index = -1;
	long long int  count = 1;
	long long int  n = 0;
	long long int  i = 1;
	cin >> c;
	n=c.length();
	int tmp, last;
	if(c[0]=='a' || c[0]=='e' || c[0]=='i' || c[0]=='o' || c[0]=='u' || c[0]=='y'){
			last=0;
		}else{
			last=1;
		}
	while (i < n){
		if(c[i]=='a' || c[i]=='e' || c[i]=='i' || c[i]=='o' || c[i]=='u' || c[i]=='y'){
			tmp=0;
		}else{
			tmp=1;
		}
		if(last==tmp){
			count++;
		}else{
			last=tmp;
			count=1;
		}
	    if(count>=3){
	    	sum+=((i-index)-2)*(n-i);
	    	index=i-2;
		}
		++i;
	}
	cout << sum;
	return 0;
}