Submission #1543180

---

Source Code Expand

#include <iostream>
#include <string>
#include <unordered_set>

using namespace std;

int main()
{
  string s;
  cin >> s;

  int p = 0;

  int a = 'a';
  int z = 'z';
  int c[z - a + 1] = { 0 };

  for ( auto& e : s ) {
    c[e-a]++;
  }

  long long x = 1 + s.size() * ( s.size() - 1 ) / 2;

  for ( int i = 0; i < z - a + 1; i++ ) {
    x -= c[i] * ( c[i] - 1 ) / 2;
  }

  cout << x << endl;

  return 0;
}

Submission Info

Judge Result