Submission #1540290

---

Source Code Expand

#include <bits/stdc++.h>

#define FOR(i,b,e) for(int i=(b); i <= (e); ++i)
#define FORD(i,b,e) for(int i=(b); i >= (e); --i)
#define REP(i,n) for(int i=0; i < (n); ++i)
#define SIZE(c) (int) (c).size()
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define ST first
#define ND second
#define FWD(i,a,b) for (int i=(a); i<(b); ++i)
#define BCK(i,a,b) for (int i=(a); i>(b); --i)
#define PI 3.14159265358979311600
#define pb push_back
#define mp make_pair
#define st first
#define nd second

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

typedef vector < int > VI;
typedef vector<ll> VL;

typedef long double K;

const int N = 200005;

int n, a[N], b[N];
char s[N];
map<char,int> cnt;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> s;
	n = strlen(s);

	REP(i, n) ++cnt[s[i]];

	ll total = 1 + 1LL*n*(n+1)/2;

	for (auto& item : cnt) {
		ll c = item.second;
		total -= c*(c+1)/2;
	}

	cout << total << '\n';

	return 0;
}

Submission Info

Judge Result