Submission #1540671

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <climits>
#include <cstdlib>
#include <vector>
#include <queue>
#include <unordered_map> 
#include <iomanip>
#include <random>
#include <future>
#include <thread>
#include <utility>
#include <set>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF (INT_MAX/3)
#define INF_L (LLONG_MAX/3)
#define PSB push_back
#define PN 1000000007
typedef long long LL;
#define int long long


// booooooooooooost
// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// namespace mp = boost::multiprecision;	//多倍長整数(mp::cpp_int), 多倍長小数(mp::cpp_dec_float_100)


signed main() {

	string a; int n;
	cin >> a;
	n = a.size();

	sort(a.begin(), a.end());
	vector<int> arr;
	arr.push_back(0);
	char tmp = a[0];
	for (char p : a) {
		if (tmp == p) {
			++arr.back();
		}
		else {
			arr.push_back(1);
			tmp = p;
		}
	}

	int ans = n * (n - 1) / 2 + 1;
	for (int p : arr) {
		ans -= p * (p - 1) / 2;
	}
	
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result