Submission #1540658

---

Source Code Expand

#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<map>
#include<iostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<char> vc;
#define rep(i,n) for (int i=1;i<=n;i++)
#define mp make_pair
#define pb push_back
#define pf push_front
#define flush fflush(stdout)
char a[200005];
ll sz;
ll ans=0;
ll cnt[200];
int main()
{
    ios::sync_with_stdio(false);
    cin>>a;
    sz=strlen(a);
    ans=sz*(sz-1)/2+1;
    for (int i=0;i<sz;i++) cnt[a[i]]++;
    for (int i='a';i<'z';i++){
    	ans-=cnt[i]*(cnt[i]-1)/2;
    }
    cout<<ans;
}

Submission Info

Judge Result