UVA 10420 List of Conquests

题目

分析

n

n

第一个单词

ˊ_>ˋ

思路

qsort()

代码

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

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

int main(void)
{
int n, i, j, k, c;
char country[2050][80], tmp[80];
scanf("%d", &n);
getchar();
for (i = 0, j = 0; i < n; i++) {
fgets(tmp, 80, stdin);
for (k = 0; tmp[k] != ' '; k++) country[j][k] = tmp[k];
j++;
}
qsort(country, n, sizeof(country[0]), cmp);
for (i = 0, c = 1; i < n; i++)
if (strcmp(country[i], country[i+1]) == 0) {
c++;
} else {
printf("%s %d\n", country[i], c);
c = 1;
}
return 0;
}