Submission #1541250

---

Source Code Expand

#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(0);
    string nap;
    cin >> nap;
    int n = nap.size();
    ll odp = 1;
    vector< vector<ll> > wyst(n + 1, vector<ll>(26, 0));
    for (int i = n - 1; i >= 0; --i)
    {
        for (int j = 0; j < 26; ++j)
            wyst[i][j] = wyst[i + 1][j];
        ++wyst[i][nap[i] - 'a'];
    }
    for (int i = 0; i < n - 1; ++i)
        for (int j = 0; j < 26; ++j)
            if (j != nap[i] - 'a')
                odp += wyst[i + 1][j];
    cout << odp;
    return 0;
}

Submission Info

Judge Result