#include <stdio.h>
#include <string.h>
#include <algorithm>
char countries[2000][40];
int cmp(const void*a,const void*b)
{
return strcmp((char *)a,(char *)b);
}
int main()
{
int n,nCountry=0,count=0;
char line[80];
scanf("%d",&n);
getchar();
for(int i=0;i<n;i++)
{
fgets(line,80,stdin);
int j=0;
while(line[j]!=' ')
{
countries[i][j]=line[j];
j++;
}
countries[i][j]='\0';
}
qsort(countries,n,sizeof(countries[0]),cmp);
for(int k=0;k<n;k++)
{
if(strcmp(countries[k],countries[k+1])!=0)
{
count++;
printf("%s %d\n",countries[k],count);
count=0;
}
else
count++;
}
return 0;
}
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=problem_stats&problemid=1361&category=98
10420 - List of Conquests
最新推荐文章于 2014-11-21 23:01:39 发布