Submission #1540296

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <algorithm>
#include <ctime>
#include <cassert>
#include <memory.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define ford(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define sz(c) int((c).size())
#define all(c) (c).begin(), (c).end()
#define mp(x, y) make_pair(x, y)
#define fst first
#define snd second

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using vii = vector<pii>;
using vvi = vector<vi>;

#define FILE_NAME ""

string s;

bool read() {
  if (!(cin >> s)) {
    return 0;
  }
  return 1;
}

void solve() {
  const int let = 26;
  vi cnt(let);
  forn (i, sz(s))
    cnt[s[i] - 'a']++;

  ll ans = 1;
  forn (i, let) forn (j, i)
    ans += (ll)cnt[i] * cnt[j];
  cout << ans << endl;
}

int main() {
#ifdef LOCAL
  freopen(FILE_NAME ".in", "r", stdin);
  freopen(FILE_NAME ".out", "w", stdout);
#endif

  ios_base::sync_with_stdio(false);

  while (read()) {
    solve();
  }

#ifdef LOCAL
  cerr << "Time: " << clock() * 1.0 / CLOCKS_PER_SEC << endl;
#endif
  return 0;
}

Submission Info

Judge Result