Submission #5824096

---

Source Code Expand

#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <iomanip>
//#include <unordered_map>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/unordered_set.hpp>
//#include <boost/unordered_map.hpp>
//#include <unistd.h>

//#include <cv.h>
//#include <highgui.h>
#include <stdlib.h>
#include <string>

std::string A;
int nums[26];

int main(int argc, char **argv) {
    std::cin >> A;

    for (int i = 0; i < A.size(); i++) {
        nums[A[i] - 'a']++;
    }

    long long ret = A.size() * (A.size() - 1) / 2;

    for (int i = 0; i < 26; i++) {
        ret -= nums[i] * (nums[i] - 1) / 2;
    }

    std::cout << ret + 1 << std::endl;

    

    return 0;
}

Submission Info

Judge Result