|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
struct dataa{
char str[50];
bool operator < (const dataa & a)const{
return strcmp(a.str,str)>0;
}
}data[100010];
int main()
{
map<char,char> m;
m[‘1‘] = ‘1‘;
m[‘0‘] = ‘0‘;
m[‘A‘] = m[‘B‘] = m[‘C‘] = m[‘2‘] = ‘2‘;
m[‘D‘] = m[‘E‘] = m[‘F‘] = m[‘3‘] = ‘3‘;
m[‘G‘] = m[‘H‘] = m[‘I‘] = m[‘4‘] = ‘4‘;
m[‘J‘] = m[‘K‘] = m[‘L‘] = m[‘5‘] = ‘5‘;
m[‘M‘] = m[‘N‘] = m[‘O‘] = m[‘6‘] = ‘6‘;
m[‘P‘] = m[‘R‘] = m[‘S‘] = m[‘7‘] = ‘7‘;
m[‘T‘] = m[‘U‘] = m[‘V‘] = m[‘8‘] = ‘8‘;
m[‘W‘] = m[‘X‘] = m[‘Y‘] = m[‘9‘] = ‘9‘;
m[‘-‘] = m[‘Q‘] = m[‘Z‘] = ‘-‘;
char str[50];int t;
scanf("%d",&t);
for(int i = 0 ; i < t ;i++){
scanf("%s",str);
char *p = str;
int pos = 0;
while(*p){
if(pos == 3)
data[i].str[pos++] = ‘-‘;
if(m[*p] != ‘-‘)
data[i].str[pos++] = m[*p];
p++;
}
}
sort(data,data + t);
int ct = 1;
int kk = 0;
for(int i = 1 ; i < t ;i++){
if(!(data[i] < data[i-1]) && !(data[i-1] < data[i]))
ct++;
else if(ct > 1){
printf("%s %d\n",data[i - 1].str,ct);
kk++;
ct = 1;
}
}
if(ct > 1){
printf("%s %d\n",data[t- 1].str,ct);
kk++;
ct = 1;
}
if(!kk) printf("No duplicates.\n");
return 0;
}
|
