Question

北大acm1002

Answer 1

#include<cstdlib>
#include<cstdio>
int comp(const void *a,const void *b)
{return *(int*)a-*(int*)b;}
int main()
{
char T[27]="2223334445556667-77888999-";
int N;
scanf("%d",&N);
getchar();
int *NO=new int[N+1];
int i=0;char c;
for(;i<N;i++)
{
NO[i]=0;
while((c=getchar())!='\n'派绝)
{
if(c>散局='A'&&c<='Z')c=T[c-'A'];
if('-'!=c)NO[i]=NO[i]*10+c-'0';
}
}
qsort(NO,i,sizeof(int),comp);
int n=0;
int k=1;
for(i=0;i<=N;i++)
{
if(NO[i]==NO[i+1])k++;
else if(k>=2)
{
int a=NO[i]/冲羡让10000,b=NO[i]%10000;
printf("%03i-%04i %i\n",a,b,k);
k=1;n++;
}
}
if(0==n)printf("No duplicates.\n");
return 0;
}