Submission #51308306

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define repl(i,a,b) for(ll i = a; i < b; i++)
#define fore(i,a) for(auto &i : a)
#define all(x) (x).begin(),(x).end()

template<class T>bool chmax(T& a, const T& b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if(b < a){ a = b; return 1; } return 0; }

void pri() { printf("\n"); }
void pri(int X) { printf("%d", X); }
void pri(long long X) { printf("%lld", X); }
void pri(double X) { printf("%.12lf", X); }
void pri(long double X) { printf("%.12Lf", X); }
void pri(size_t X) { printf("%zd", X); }
void pri(bool X) { printf("%d", (int)X); }
void pri(char X) { printf("%c", X); }
void pri(string X) { printf("%s", X.c_str()); }
template<class T, class U>void pri(pair<T, U> X) { pri(X.first); printf(" "); pri(X.second); }
template<class T>void pri(vector<T> X) { rep(i,0,(int)X.size()){ if(i){ printf(" "); } pri(X[i]); }}
template<class T>void pri(vector<vector<T>> X) { rep(i,0,(int)X.size()){ if(i){ printf("\n"); } pri(X[i]); }}
void prin() {}
template <class Head, class... Tail>void prin(Head&& head, Tail&&... tail) {
    pri(head); printf("\n"); prin(forward<Tail>(tail)...);
}

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const ll MOD = 1000000007;
const int INF = INT_MAX/2;
const ll INFL = LLONG_MAX/2;



int main() {
    string S; cin >> S;
    
    ll N = S.size();
    
    
    map<char, ll> m;
    rep(i,0,N) m[S[i]]++;
    
    
    bool Flag = 0;
    ll Ans = N*(N-1)/2;
    
    fore(M, m) {
        if(1 < M.second) Flag = 1;
        Ans -= M.second * (M.second-1) / 2;
    }
    
    Ans += (ll)Flag;
    
    prin(Ans);
}

Submission Info

Judge Result