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
#include <iostream>
#include <map>
#include <string>

using namespace std;
using LL = long long;
using PII = pair<int, int>;

LL solve1(string word)
{
	LL res = 0;
	char prev = 'd';
	LL cnt = 0;

	for (int i = 0; i < word.length(); ++i)
	{
		if (word[i] != prev)
		{
			prev = word[i];
			cnt = 0;
		}

		++cnt;
		res += cnt;
	}

	return res;
}

LL solve2(string word, char x, char y)
{
	LL res = 0;

	map<int, int> dist;
	int d = 0;

	dist[d] = 1;

	for (int i = 0; i < word.length(); ++i)
	{
		if (word[i] == x || word[i] == y)
		{
			d += word[i] == x ? 1 : -1;

			auto it = dist.find(d);

			if (it != dist.end())
			{
				res += it->second;
				++dist[d];
			}
			else
			{
				dist[d] = 1;
			}
		}
		else
		{
			dist.clear();
			d = 0;

			dist[d] = 1;
		}
	}

	return res;
}

LL solve3(string word, char x, char y, char z)
{
	LL res = 0;

	map<PII, int> dist;
	PII d = make_pair(0, 0);

	dist[d] = 1;

	for (int i = 0; i < word.length(); ++i)
	{
		if (word[i] == x)
		{
			++d.first;
		}
		else if (word[i] == y)
		{
			--d.first;
			++d.second;
		}
		else
		{
			--d.second;
		}

		auto it = dist.find(d);

		if (it != dist.end())
		{
			res += it->second;
			++dist[d];
		}
		else
		{
			dist[d] = 1;
		}
	}

	return res;
}

int main()
{
	string word;
	cin >> word;

	LL res = solve1(word);
	res += solve2(word, 'a', 'b');
	res += solve2(word, 'a', 'c');
	res += solve2(word, 'b', 'c');
	res += solve3(word, 'a', 'b', 'c');

	cout << res << endl;

	return 0;
}