ZOJ_2004 2104Let the Balloon Rise
来源:互联网 发布:java中什么叫重用 编辑:程序博客网 时间:2024/06/05 21:10
/* 第一回交的时候居然错了
Let the Balloon Rise
--------------------------------------------------------------------------------
Time Limit: 1 Second Memory Limit: 32768 KB
--------------------------------------------------------------------------------
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<iostream>
#include<cstdio>
using namespace std;
bool hash[1005];
int main()
{
int n, i, j;
char str[1005][20];
while(scanf("%d", &n) != EOF && n)
{
for(i = 0; i < n ; i++)
scanf("%s", str[i]);
memset(hash, false, sizeof(hash));
int a;
int max1 = INT_MIN;
int count;
for(i = 0; i < n ;i++)
{
if(hash[i]) continue;
count = 0;
for(j = i + 1; j < n; j++)
if(strcmp(str[i],str[j]) == 0)
{
count++;
hash[j] = true;
}
if(count > max1)
{
max1 = count;
a = i;
}
}
printf("%s/n", str[a]);
}
}
- ZOJ_2004 2104Let 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
- 数据库操作大全(收集)
- 一天一天的
- TreeView
- 单一世界【6】DDOS防御
- Asp.NET中常用的一些优化性能的方法
- ZOJ_2004 2104Let the Balloon Rise
- ACM会用到的一点数学知识
- 建立一个别人永远删不掉的管理员用户
- Protel异常
- HDOJ 1561The more, The Better(树状DP)
- No.16
- WCF RIA Service 基础—Data Binding, Creating and Editing
- 手机云
- 设计模式-Composite模式戏说