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
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
// Grzegorz Ryn
// V LO Kraków

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define st first
#define nd second
#define FOR(__VAR, __START, __END) for(int __VAR=__START; __VAR<=__END; __VAR++)
#define FORB(__VAR, __START, __END) for(int __VAR=__START; __VAR>=__END; __VAR--)
#define FORK(__VAR, __START, __END, __DIFF) for(int __VAR=__START; __VAR<=END; __VAR+=__DIFF)
#define all(__VAR) (__VAR).begin(), (__VAR).end()
#define rall(__VAR) (__VAR).rbegin(), (__VAR).rend()
#define DEBUG(__VAR) cout << #__VAR << ": " << __VAR << endl;

template<typename __T1, typename __T2>
ostream & operator<<(ostream &out, pair<__T1, __T2> &__VAR) {
	cout << "[" << __VAR.st << ", " << __VAR.nd << "]";
	return out;
}

template<typename __T>
ostream & operator<<(ostream &out, vector<__T> &__VAR) {
	cout << "[";
	FOR(i, 0, (int)__VAR.size()-2)
		cout << __VAR[i] << ", ";
	if(__VAR.size()>0)
		cout << __VAR[__VAR.size()-1];
	cout << "]" << endl;
	
	return out;
}

const int INF=1e9;

vector<int> get_input() {
	string s;
	cin >> s;
	vector<int> S(s.length());
	for(int i=0; i<s.length(); i++) {
		S[i] = s[i]-'a';
	}
	return S;
}

ll solve() {
	vector<int> S = get_input();
	int N = S.size();
	ll result = 0;
	
	auto update = [&](int l, int r, array<bool,3> v) {
		ll res = 0;
		array<int,3> C = {0, 0, 0};
		map<array<int,3>, ll> cnt;
		cnt[{0,0,0}] = 1;
		
		for(int i=l; i<=r; i++) {
			C[S[i]]++;
			int mn = INF;
			for(int j=0; j<3; j++) {
				if(v[j] == false) {
					continue;
				}
				mn = min(mn, C[j]);
			}
			array<int,3> tup = {0, 0, 0};
			for(int j=0; j<3; j++) {
				if(v[j] == false) {
					continue;
				}
				tup[j] = C[j]-mn;
			}
			
			res += cnt[tup];
			cnt[tup]++;
		}
		return res;
	};
	
	for(int sub=1; sub<(1<<3); sub++) {
		array<bool,3> v = {0, 0, 0};
		for(int i=0, s=sub; i<3; i++, s/=2) {
			v[i] = s%2;
		}
		
		for(int l=0, r=-1; l<N; l++) {
			if(v[S[l]] == false || l <= r) {
				continue;
			}
			r = l;
			while(r < N && v[S[r]] == true) {
				r++;
			}
			result += update(l, r-1, v);
		}
	}
	
	return result;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cout << solve() << '\n';

	return 0;
}