#include<stdio.h>
#include<string.h>
void simplify(char b[15],char sim[7])
{    int i,j=0;
	 for(i=0;b[i]!='\0'&&i<=14;i++)
        switch(b[i])
	 {  case 'A':case 'B':case 'C':b[i]='2';break;
		case 'D':case 'E':case 'F':b[i]='3';break;
		case 'G':case 'H':case 'I':b[i]='4';break;
		case 'J':case 'K':case 'L':b[i]='5';break;
		case 'M':case 'N':case 'O':b[i]='6';break;
		case 'P':case 'R':case 'S':b[i]='7';break;
		case 'T':case 'U':case 'V':b[i]='8';break;
		case 'W':case 'X':case 'Y':b[i]='9';break;
        case '\n':b[i]='\0';break;
		default :;	
	 }
     for(i=0;b[i]!='\0'&&i<=99;i++)
		if(b[i]=='-') continue;
		else *(sim+(j++))=b[i];
}
void compare(char a[][8],char sim[8],int an[])
{    int i,j,found=0;
     for(i=0;a[i][0]!='\0'&&i<=99999;i++)
	 {for(j=0;j<=7;j++)
			 if(sim[j]==a[i][j]) continue;
			 else break;
	  if(j==8) {found=1;break;}
	 }
     if(found==0) for(j=0;j<=7;j++) a[i][j]=sim[j];
	 else ;
	 an[i]++;
}
void sort(char a[][8],int an[])
{    int i,j,k;
     char ch[8];
     for(i=0;a[i+1][0]!='\0';i++)
		for(j=i+1;a[j][0]!='\0';j++)
			if(strcmp(a[i],a[j])>0) 
			{for(k=0;k<=7;k++)
			{ch[k]=a[i][k];a[i][k]=a[j][k];a[j][k]=ch[k];}
			{k=an[i];an[i]=an[j];an[j]=k;}
			}
}
main()
{   int n,i,an[10000]={0},j,printed=0;
    char a[100000][8]={'\0'},b[100]={'\0'},sim[8]={'\0'};
	scanf("%d%*c",&n);
    for(i=1;i<=n;i++)
	{gets(b);
     simplify(b,sim);
	 compare(a,sim,an);
    }
    sort(a,an);
	for(i=0;a[i][0]!='\0';i++)
	{if(an[i]==1) continue;
        else 
		{  printed=1;
		for(j=0;j<=7;j++) 
		{if(j==3) printf("-");
		printf("%c",a[i][j]);}
        printf(" %d\n",an[i]);
	
		}
	}
   if(printed==0) printf("No duplicates.");
}
	

• 缩进真混乱 (0) 150014 2008-10-29 20:34:08