Submission #1540550

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define MP(a,b) make_pair(a,b)
typedef long long LL;
typedef pair<int, int> PI;
typedef vector<int> VI;
const LL MOD = 1000000007LL;
int main() {
	string A;
	cin >> A;
	int cnt[26] = { 0 };
	LL sum = 0;
	for (int i = A.size() - 1; i >= 0; i--) {
		sum += (A.size() - 1 - i) - cnt[A[i]-'a'];
		cnt[A[i] - 'a']++;
	}
	cout << sum + 1 << endl;
}

Submission Info

Judge Result