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
#include <bits/stdc++.h>
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define TRAV(i, a) for(auto & i : (a))
#define SZ(x) ((int)(x).size())
#define X first
#define Y second
#define PR std::pair
#define MP std::make_pair
typedef long long ll;
typedef std::pair<int, int> PII;
typedef std::vector<int> VI;

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);

	std::string s;
	std::cin >> s;
	int n = SZ(s);
	ll ans = 0;

	typedef std::array<int, 3> Trujka;

	REP(mask, 1, 1<<3){
		int cnt = __builtin_popcount(mask);

		std::vector<Trujka> pref(n+1, Trujka{});
		FOR(i, n){
			FOR(j, 3) pref[i+1][j] = pref[i][j];
			pref[i+1][s[i]-'a']++;
		}

		std::map<Trujka, int> map;
		FOR(i, n+1){
			FOR(j, 3){
				if(mask & (1<<j)) pref[i][j] = i - cnt*pref[i][j];
			}
			ans += map[pref[i]];
			map[pref[i]]++;
		}
	}

	std::cout << ans << "\n";
	return 0;
}