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
#include <bits/stdc++.h>
using namespace std;

#ifndef _WIN32
    #define getchar getchar_unlocked
#endif

#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
//#define int LLI
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define F1(i,n) FOR(i,1,n)

typedef long long LLI;
typedef unsigned long long LLU;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<LLI, LLI> pll;
typedef vector<int> vi;

#ifdef ONLINE_JUDGE
ostream cnull(NULL);
#define cerr cnull
#endif

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',') cerr<<*sdbg++;
  cerr<<"="<<h<<",";
  _dbg(sdbg+1, a...);
}
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define dbgV(R) {cerr << #R << "=["; for(int e : R) cerr << e << ", "; cerr << "E]\n";}
#define dbgA(R, n) {cerr << #R << "=["; for(int i = 0; i <= n; ++i) cerr << R[i] << ", "; cerr << "E]\n";}
#define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

bool samogloska[256];
string s; 
inline bool trojka(int p, int k){
	if(k - p < 2) return 1;
	for(int i = k; i > k - 2; --i){
		if(samogloska[int(s[i])] != samogloska[int(s[i - 1])]) return 1;
	}
	return 0;
}

int32_t main()
{
    boost;
	samogloska['a'] = 1; samogloska['e'] = 1; samogloska['i'] = 1; samogloska['o'] = 1; samogloska['u'] = 1; samogloska['y'] = 1;
	cin >> s; int n = SZ(s);
	int kon = 0; LLI wyn = 0;
	for(int i = 0; i < n; ++i){
		kon = max(kon, i);
		while(kon + 1 < n && trojka(i, kon + 1)) ++kon;
		wyn += (kon - i + 1);
	}
	cout << (LLI(n)*(n+1)) / 2 - wyn;
}