poj1002

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
int n,t,num;

char s[300],c[30]="2223334445556667777888999";
int main()
{
while(~scanf("%d",&n))
{
priority_queue<int, vector<int>, greater<int> >  st;
while(n--)
{
scanf("%s",s);
t=0;
int len=strlen(s);
for(int i=0;i<len;i++)
{
if(s[i]!='-')
{
if(s[i]>='0'&&s[i]<='9')
t=t*10+s[i]-'0';
else t=t*10+c[s[i]-'A']-'0';
}
}
st.push(t);
}
int flag=0;
while(!st.empty())
{
t=st.top();
st.pop();
num=1;
while(!st.empty()&&t==st.top())
{
num++;
st.pop();
}
if(num>1)
{
printf("%03d-%04d %d\n",t/10000,t%10000,num);
flag=1;
}
}
if(flag==0)
printf("No duplicates.\n");
}
return 0;
}