Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

1002 谁来救救我,总是wa

Posted by pineapple76 at 2012-03-07 22:06:25
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int cmp(const void *a,const void *b)
{
	return (strcmp((char *)a,(char *)b));
}

char map[]="22233344455566677778889999";
char tel[100010][9],str[100];

void stard(int n)
{
	int j,k;
	j=k=0;
	while(k<8)
	{
		while(str[j]=='-')j++;
		if(k==3)
		{
			tel[n][k]='-';
			k++;
		}
		if(str[j]>='A'&&str[j]<='Z')
			tel[n][k]=map[str[j]-'A'];
		else if(str[j]>='0'&&str[j]<='9')
		    tel[n][k]=str[j];
		j++;
		k++;
	}
	tel[n][k]='\0';
	return;
}

int main()
{
	int n,i,j,flag;
	flag=1;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%s",str);
		stard(i);
	}
	qsort(tel,n,9,cmp);
	i=0;
	while(i<n)
	{
		j=i;
		i++;
		while(i<n&&strcmp(tel[i],tel[j])==0)i++;
		if(i-j>1)
		{
			printf("%s %d\n",tel[j],i-j);
			flag=0;
		}
	}
	if(flag==1)
		printf("NO duplicates.\n");
	return 0;
}





Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator