3
TUT-GLOP
3-10-10-10
310-1010

310-1010 2

#include<iostream>
#include<cstdio>
#include<cstring>
#define mod 1000003
using namespace std;
int t[1000004],n;
long long map[1000005];
char s[1001];
void Hash(char ch[],int len){long long res=1,now=0;for(int i=1;i<=len;i++){if(ch[i]<='9'&&ch[i]>='0')res=(res*10+ch[i]-'0')%mod,now=now*10+ch[i]-'0';else{if(ch[i]<='C'&&ch[i]>='A')res=(res*10+2)%mod,now=now*10+2;if(ch[i]<='D'&&ch[i]>='F')res=(res*10+3)%mod,now=now*10+3;if(ch[i]<='G'&&ch[i]>='I')res=(res*10+4)%mod,now=now*10+4;if(ch[i]<='J'&&ch[i]>='L')res=(res*10+5)%mod,now=now*10+5;if(ch[i]<='M'&&ch[i]>='O')res=(res*10+6)%mod,now=now*10+6;if(ch[i]=='P'||ch[i]=='R'||ch[i]=='S')res=(res*10+7)%mod,now=now*10+7;if(ch[i]<='T'&&ch[i]>='V')res=(res*10+8)%mod,now=now*10+8;if(ch[i]<='W'&&ch[i]>='Y')res=(res*10+9)%mod,now=now*10+9;}}if(!t[res])map[res]=now;t[res]++;
}
void Print(int x){printf("%d-",map[x]/10000);printf("%d",map[x]%10000);
}
int main(){freopen("Cola.txt","r",stdin);scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%s",s+1);int len=strlen(s+1);Hash(s,len);}for(int i=1;i<=1000003;i++){if(t[i]>1){Print(i);printf(" %d\n",t[i]);}}return 0;
}

/*以后不要逞强用hash了！就选stl map<string,int>
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,map[27]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9};
string s[100010],c;
int main(){freopen("Cola.txt","r",stdin);scanf("%d",&n);for(int i=1;i<=n;i++){cin>>c;int len=c.length();for(int j=0;j<c.length();j++){if(c[j]=='-')continue;if(c[j]<='9'&&c[j]>='0')s[i]+=c[j];else s[i]+=map[c[j]-'A']+'0';}}int t=1;bool flag=0;sort(s+1,s+n+1);for(int i=1;i<=n+1;i++){if(s[i]!=s[i-1]){if(t>1)flag=1,cout<<s[i-1].substr(0,3)<<'-'<<s[i-1].substr(3,4)<<' '<<t<<endl;t=1;}else t++;}if(!flag)printf("No duplicates.");return 0;
}