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
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> para;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define MP make_pair


int main() {
  LL k, l, m, n;
  int i;
  LL S=0, s;
  string a;
  bool v[128], w;

  REP(i,128) v[i]=false;
  v['a']=v['e']=v['i']=v['o']=v['u']=v['y']=true;

  a.reserve(200001);
  cin>>a;
  n=a.length();
  if (n<3) {cout<<"0\n"; return 0;}

  a+=(v[a[n-1]] ? 'z' : 'a');

  k=l=0;

  do {     //k ustalone, szukaj l i m

    w=v[a[l]];
    i=l;

    while (v[a[++i]]==w);
    if (i<=l+2) {
      w=!w; l=i;
      continue;
    }

    m=i-1;
//cout<<k<<"  "<<l<<"  "<<m<<endl;

    s=(n-2)*(m-k-1)-l*(l-k+1)-((m-2)*(m-1)-l*(l+1))/2;
//cout<<s<<endl;
    S+=s;
    l=i;
    k=m-1;

  } while (i<n);

//S=n*S1-S2/2;
  cout<<S<<endl;
  return 0;
}