Let the Balloon Rise
来源:互联网 发布:暗黑破坏神3 知乎 编辑:程序博客网 时间:2024/04/27 14:42
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 72824 Accepted Submission(s): 27167
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
做的比较复杂但思路简单,水了
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int n;
while(scanf("%d",&n),n)
{
int i,j,a[1010],b[1010];
char s[1010][20];
memset(a,0,sizeof(a));
for(i=0; i<n; i++)
{
scanf("%s",s[i]);
}
for(i=0; i<n; i++)
for(j=i+1; j<n; j++)
{
if(strcmp(s[i],s[j])==0)
a[i]++;
}
for(i=0; i<n; i++)
b[i]=a[i];
sort(a,a+n,cmp);
for(i=0; i<n; i++)
if(a[0]==b[i])
break;
printf("%s\n",s[i]);
}
return 0;
}
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the balloon rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- php 解析XML的几种方式
- Python线程---经过了测试,但运行结束后,不退出解释器
- Android延长Toast显示时间的方法
- LeetCode刷题笔录Gas Station
- 百度员工离职总结:如何做个好员工
- Let the Balloon Rise
- linux shell是一种极为丑陋的语言
- 人生大问题,你思想过你的思想吗?
- PDO进行sql语句预处理和操作结果集详细介绍(二)
- Fragment 出现Can not perform this action after onSaveInstanceState
- 开门人和关门人
- 网络通信原理
- 如何将PPT转换成PDF格式
- jason与array之间的相互转换