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
// Karol Kosinski 2021
#include <bits/stdc++.h>
#define ENABLE_DEBUG
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define TIE(x...) int x;tie(x)
#define X first
#define Y second
#ifndef ENABLE_DEBUG
#define DEB(k,f,x...)
#else
#define DEB(k,f,x...) {if(k)printf("--------%4d : %s\n",__LINE__,__FUNCTION__);f(x);}
#endif
#define DEBL DEB(1,void,0)
#define DEBF(f,x...) DEB(1,f,x)
#define DEBUG(x...) DEB(0,printf,x)
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;

constexpr LL FA = -999'999'999'999LL;
constexpr LL FB =          999'999LL;
constexpr LL FC =  999'999'000'000LL;
constexpr LL F_ =        1'000'000LL;

constexpr int NX = 300'001;

int n;
char S[NX];
map<LL, LL> M;

LL count(LL a, LL b, LL c)
{
    LL cur = 0, sum = 0;
    M[cur] = 1;
    FOR(i,0,n)
    {
        switch ( S[i] )
        {
            case 'a' : cur += a; break;
            case 'b' : cur += b; break;
            case 'c' : cur += c; break;
        }
        ++ M[cur];
    }
    for ( const auto& it : M )
        sum += it.Y * (it.Y - 1) / 2;
    M.clear();
    return sum;
}

int main()
{
    scanf("%s", S);
    n = strlen(S);
    LL res = 0;
    res += count(  0, F_, F_ );
    res += count( F_,  0, F_ );
    res += count( F_, F_,  0 );
    res += count( +1, -1, F_ );
    res += count( F_, +1, -1 );
    res += count( -1, F_, +1 );
    res += count( FA, FB, FC );
    printf("%lld\n", res);
    return 0;
}