B. Choosing Symbol Pairs
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single input line contains S, consisting of lowercase Latin letters and digits. It is guaranteed that string S in not empty and its length does not exceed 105.
Output
Print a single number which represents the number of pairs i and j with the needed property. Pairs (x, y) and (y, x) should be considered different, i.e. the ordered pairs count.
Sample test(s)
input
great10
output
7
input
aaaaaaaaaa
output
100
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
char str[100000];
double ans=0;
int flag[200];
int main()
{
while(cin>>str)
{
memset(flag,0,sizeof(flag));
int n=strlen(str);
for(int i=0;i<n;i++)
{
flag[str[i]]++;
}
for(int i='0';i<='z';i++)
{
ans+=(double)flag[i]*flag[i];
}
printf("%.0lf\n",ans);//****用cout<<ans<<endl;不可
ans=0;
}
return 0;
}