1073 -- Let the Balloon Rise

最新推荐文章于 2024-08-05 14:54:13 发布

jtahstu_akoj

最新推荐文章于 2024-08-05 14:54:13 发布

阅读量3k

点赞数

CC 4.0 BY-SA版权

分类专栏： akoj 文章标签： akoj

本文链接：https://blog.youkuaiyun.com/jtahstu_akoj/article/details/48088729

akoj 专栏收录该内容

250 篇文章

订阅专栏

本文深入探讨了AI音视频处理领域中的视频分割与语义识别技术，介绍了视频分割的基本概念、常见算法及其实现方式，并详细讲解了语义识别在智能视频分析中的应用。通过实例分析，揭示了如何利用先进的计算机视觉技术实现视频内容的理解与智能应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Let the Balloon Rise

Time Limit:1000MS Memory Limit:65536K
Total Submit:105 Accepted:67

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

Hint

输出出现次数最多的单词，次数相同则输出第一次出现的单词

Source

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace AK1073 {
    class Program {
        static void Main(string[] args) {
            string sn;
            while (!(sn = Console.ReadLine()).Equals("0")) {
                int n = int.Parse(sn);
                string[] s = new string[n + 5];
                for (int i = 0 ; i < n ; i++)
                    s[i] = Console.ReadLine();
                string axb = s[0];
                Array.Sort(s , 0 , n);
                int max = 1;
                int count = 1;
                int flag = 0;
                for (int i = 0 ; i < n ; i++) {
                    count = 1;
                    for (int j = i + 1 ; j < n ; j++) {
                        if (s[j].Equals(s[i]))
                            count++;
                        else
                            break;
                    }
                    if (count > max) {
                        max = count;
                        flag = i;
                    }
                }
                if (max == 1)//??????????????????????????????????????????????????????????????
                    Console.WriteLine(axb);
                else
                    Console.WriteLine(s[flag]);
            }
        }
    }
}