bedao_r03_kindness.cpp

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  string s; cin >> s;
  int n = s.size();
  ll ans = (ll) n * (n - 1) / 2;
  map<char, int> cnt;
  for (int i = 0; i < n; i++) {
    ans -= cnt[s[i]];
    cnt[s[i]]++;
  }
  cout << ans + (int)(cnt.size() < n) << '\n';
}