ACM 1004题

题目

代码

#include <stdio.h>
#include <string.h>
struct Node{
	char color[15];
	int count ;
}node[1000];

int main() {
int n;
int size,new_color;
char c[15];
while(1){
	scanf("%d",&n);
	if(n == 0)
		return 0;
	size = 0;
	for(int i = 0;i<n;i++){
		scanf("%s",c);
		new_color = 1;
		for(int j = 0;j<size;j++){
			if(!strcmp(node[j].color,c)){
				node[j].count++;
				new_color = 0;
				break;
				}
			}
		if(new_color){
			strcpy(node[size].color,c);
			node[size].count = 1;
			size ++;
			}
		}
	int max = 1,index;
	for(int k = 0 ;k<size;k++){
		if(node[k].count>max){
			max = node[k].count;
			index = k;
			}
		}
	printf("%s\n",node[index].color);
	
	}	

	return 0;
}