Submission #1540554

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
const int MaxN = 2e5;
typedef long long LL;
using namespace std;
char s[MaxN + 5];
int vis[200];
int main()
{
	while(~scanf("%s", s + 1)){
		int len = strlen(s + 1);
		LL res = 0;
		memset(vis, 0, sizeof(vis));
		for(int i = 1;i <= len;i++){
			res += (i - vis[s[i]] - 1);
			vis[s[i]]++;
		}
		printf("%lld\n", res + 1);
	}
}

Submission Info

Judge Result