#include<iostream.h>
#include <stdlib.h>
int n,i,j,k,l=0;
	char a[100001][20];
	int num[]={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};
	int count[1000];
	long tele[100001];
int compare(const void *a,const void *b){
		return (*(int *)a-*(int *)b);
	}
void main(){
	cin>>n;
	for(i=0;i<n;i++){
		tele[i]=0;
		k=0;
		cin>>a[i];
		for(j=0;a[i][j]!='\0';j++){
			if(a[i][j]>='A' && a[i][j]<='Y'){
				tele[i]=tele[i]+num[a[i][j]-'A'];
				tele[i]=tele[i]*10;
			}
			else if(a[i][j]>='0' && a[i][j]<='9'){
				tele[i]=tele[i]+a[i][j]-'0';
				tele[i]=tele[i]*10;
			}
		}
		tele[i]=tele[i]/10;
	}
	qsort((void *)tele,n,sizeof(int),compare);
	for(i=0;i<n;i++){
		count[i]=1;
		for(k=0;k<i;k++){
			if(tele[k]==tele[i]){
				tele[i]=0;
				count[k]++;
			}
		}
	}

	for(i=0;i<n;i++){
		if(count[i]>1 && tele[i]!=0){
			l=1;
			cout<<tele[i]/10000<<"-"<<tele[i]%10000;
			cout<<" "<<count[i]<<endl;
		}
	}
	if(l!=1) cout<<"No duplicates."<<endl;
}

• Re:哭求请教，实在是郁闷，总是超时 (55) septemsure 2006-03-18 11:21:05
  • Re:哭求请教，实在是郁闷，总是超时 (77) evernever 2006-03-18 18:21:41
    • 现在变wa了 (1234) evernever 2006-03-18 18:49:47
      • Re:现在变wa了 (41) septemsure 2006-03-18 22:39:08
        • Re:现在变wa了 (62) evernever 2006-03-19 14:08:49