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

using namespace std;

int main()
{
    string T;
    char Z;
    cin >> T;
    int L=0, n=T.length(), od=0, LS=0, k, p;
    for (k=0;k<n;k++)
    {
        Z=T[k];
        if (Z=='a' || Z=='e' || Z=='i' || Z=='o' || Z=='u' || Z=='y')
            if (LS<0) LS=1;
            else LS++;
        else
            if (LS>0) LS=-1;
            else LS--;

        if (LS==3 || LS==-3)
        {
            p=k-1-od;
            L+=p*(n-od-1-p);
            if (LS==3) LS--; else LS++;
            od=k-1;
        }
    }
    cout<<L;
    return 0;
}