Submission #1551297

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <ctime>
#include <map>
#include <set>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>=y?x:y)
#define min(x,y) (x<=y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 1044266558
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
ll a[200005][30],ans;
char s[200005];
int main()
{
	while(scanf("%s",s+1)!=EOF)
	{
		memset(a,0,sizeof(a));
		int len=strlen(s+1);
		ans=0;
		for(int i=1;i<=len;i++)
		{
			for(int j=0;j<26;j++)
				a[i][j]=a[i-1][j];
			a[i][s[i]-'a']++;
		}
		for(int i=1;i<=len;i++)
			ans+=len-i-a[len][s[i]-'a']+a[i][s[i]-'a'];
		printf("%lld\n",ans+1);
	}
	return 0;
}

Submission Info

Judge Result