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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PPC(x) __builtin_popcountll(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define LSB(x) __builtin_ctz(x)
#define ARG(x, i) (get<i>(x))
#define ithBit(m, i) ((m) >> (i) & 1)
#define pb push_back
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std; 
 
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b);	}
 
const int maxN = 1 << 19;

long long f(string& T, string pres, string band)
{
	const int s = SZ(pres) + SZ(band);	
	map <vector <int>, int> M {{vector <int> (s), 1}};
	map <char, int> cnt;
	long long ret = 0;
	
	for (char x : T)
	{
		cnt[x]++;
		vector <int> key;
		for (char c : pres)
			key.pb(cnt[c] - cnt[pres[0]]);
		for (char c : band)
			key.pb(cnt[c]);
			
		assert(SZ(key) == s);
		ret += M[key]++;
	}	
	return ret;
}

char buff[maxN];

void solve()
{
	scanf ("%s", buff);
	string T(buff);
	const string abc {"abc"};
	long long res = f(T, abc, "");

	for (char c : abc)
	{
		string one(1, c), two;
		for (char d : abc)
			if (d != c)
				two.pb(d);
				
		res += f(T, one, two);
		res += f(T, two, one);
	}
	printf("%lld\n", res);
}
 
int main()
{
	//srand(time(0));
	int t = 1;
	//scanf ("%d", &t);
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}