杭电oj 1004

最新推荐文章于 2020-06-21 15:30:16 发布

FaceSeace

最新推荐文章于 2020-06-21 15:30:16 发布

阅读量326

点赞数 1

本文链接：https://blog.csdn.net/FaceSeace/article/details/88067008

版权

Problem Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges’ favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.

This year, they decide to leave this lovely job to you.

Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) – the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.

A test case with N = 0 terminates the input and this test case is not to be processed.

Output
For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.

Sample Input
5
green
red
blue
red
red
3
pink
orange
pink
0

Sample Output
red
pink

问哪个颜色出现的次数最多
输入0表示结束
字符串比较

#include <stdio.h>
#include <string.h>
int main(void) {
    int n;
    while(scanf("%d", &n) && n) {    //如果n为0结束循环
        int max = 0, x= 0, b[1000] = {0};
        char a[1000][16];
        for(int i = 0;i < n;i++)
            scanf("%s", &a[i]);
        for(int i = 0;i < n;i++) {
            for(int j = i + 1;j < n;j++)    //直接暴力比较,相同就+1,最后输出出现次数最多的那个颜色
                if(strcmp(a[i],a[j]) == 0)
                    b[i]++;
            if(b[i] > max) {
                max = b[i];
                x = i;
            }
        }
        printf("%s\n", a[x]);
    }
    return 0;
}