排序检索B - List of Conquests

本文介绍了一个使用C语言编写的程序,该程序能够从输入中统计不同国家的名称及其出现次数,并按字母顺序输出这些国家名及对应的计数。




































这题题目长不难

每句话第一个单词是国家

输出是统计国家的名字和出现的次数

输出之前要根据国家名字排序

因为要对应国家的名字和次数

用结构体非常方便


#include <stdio.h>
#include <string.h>
#include <ctype.h>
#define N 100000
struct list{
	char name[2000];
	int num;
}s[N], ss;
int main(){
	int n, mark, num = 0;
	char c[2000], city[2000];
	scanf("%d", &n);
	getchar();
	while (n--) {
		gets(c);
		for (int i = 0; i < strlen(c); i++)
			if (c[i] == ' ') {
				mark = i;
				break;
			}
		for (int i = 0; i < mark; i++)
			city[i] = c[i];
		city[mark] = '\0';
		int k;
		for (k = 0; k < num; k++)
			if (strcmp(s[k].name, city) == 0) {
				s[k].num++;
				break;
			}
		if (k == num) {
			strcpy(s[k].name, city);
			s[k].num++;
			num++;
		}
		for (int i = 0; i < num; i++)  
            for (int j = 0; j < num; j++) {  
                if (strcmp(s[i].name, s[j].name) < 0) {  
                    ss = s[i];  
                    s[i] = s[j];  
                    s[j] = ss;  
                }  
            }  
	}
	for (int i = 0; i < num; i++)
		printf("%s %d\n", s[i].name, s[i].num);
	return 0;
}




In Act I, Leporello is telling Donna Elvira about his master's long list of conquests:
\This is the list of the beauties my master has loved, a list I've made out myself: take
a look, read it with me. In Italy six hundred and forty, in Germany two hundred and
thirty-one, a hundred in France, ninety-one in Turkey; but in Spain already a thousand and
three! Among them are country girls, waiting-maids, city beauties; there are countesses,
baronesses, marchionesses, princesses: women of every rank, of every size, of every age."
(Madamina, il catalogo questo)
As Leporello records all the \beauties" Don Giovanni \loved" in chronological order, it is very
troublesome for him to present his master's conquest to others because he needs to count the number
of \beauties" by their nationality each time. You are to help Leporello to count.
Input
The input consists of at most 2000 lines. The rst line contains a number
n
, indicating that there will
be
n
more lines. Each following line, with at most 75 characters, contains a country (the rst word)
and the name of a woman (the rest of the words in the line) Giovanni loved. You may assume that the
name of all countries consist of only one word.
Output
The output consists of lines in alphabetical order. Each line starts with the name of a country, followed
by the total number of women Giovanni loved in that country, separated by a space.
SampleInput
3
Spain Donna Elvira
England Jane Doe
Spain Donna Anna
SampleOutput
England 1
Spain 2
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值