Codeforces 43 A. Football

点击打开链接

A. Football

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are n lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of lines in the description. Then follow n lines — for each goal the names of the teams that scored it. The names are non-empty lines consisting of uppercase Latin letters whose lengths do not exceed 10 symbols. It is guaranteed that the match did not end in a tie and the description contains no more than two different teams.

Output

Print the name of the winning team. We remind you that in football the team that scores more goals is considered the winner.

Sample test(s)

input

1
ABC

output

ABC

input

5
A
ABA
ABA
A
A

output

A

题目大意：找出现次数最多的字符串；

解题思路：太水了，直接上代码：

/*
Date : 2015-09-08 晚上

Author : ITAK

Motto :

今日的我要超越昨日的我，明日的我要胜过今日的我；
以创作出更好的代码为目标，不断地超越自己。
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
char str[105][15];
char s[15];
int sum[105];
int main()
{
    int n, j, k=0;
    scanf("%d",&n);
    memset(sum, 0, sizeof(sum));
    for(int i=0; i<n; i++)
    {
        cin>>s;
        for(j=0; j<k; j++)
        {
            if(!strcmp(str[j],s))
            {
                sum[j]++;
                break;
            }
        }
        if(j == k)
        {
            strcpy(str[j],s);
            k++;
            sum[j]++;
        }
    }
    int Max = -999, t;
    for(int i=0; i<n; i++)
    {
        if(sum[i] > Max)
        {
            Max = sum[i];
            t = i;
        }
    }
    puts(str[t]);
    return 0;
}