Let the Balloon Rise
来源:互联网 发布:网络侵犯知识产权犯罪 编辑:程序博客网 时间:2024/04/27 19:54
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 58065 Accepted Submission(s): 21274
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
Author
WU, Jiazhi
Source
ZJCPC2004
Recommend
JGShining
#include<stdio.h>
#include<string.h>
#define N 1000
int main(){
int n,i,j,k,l;
char a[N][15],b[N]={0};
while(scanf("%d",&n)!=EOF&&n!=0)
{
getchar();
for(i=0;i<n;i++)
{
b[i]=0;
gets(a[i]);
for(j=0;j<n;j++)
{
if(strcmp(a[i],a[j])==0)
{
b[i]++;
}
}
}
k=0;
for(i=0;i<n;i++)
{
if(k<b[i])
{
k=b[i];
l=i;
}
}
printf("%s\n",a[l]);
}
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
- 基于ar9331 mips架构AP121 uboot分析(2) 顶层Makefile,mkconfig
- codeforces MemSQL start[c]up Round 2 - online version A(模拟/二分查找) and B (最长公共子系列)
- HDU1212 Big Number 解题报告
- 《计算机程序设计与艺术》问题摘录(一)
- NEFU705(数论+DP)
- Let the Balloon Rise
- 快速排序(JAVA版)
- Java GUI基础
- afxwin.h 与stdafx.h
- poj 1603 Risk_spfa向前星
- Android如何防止apk程序被反编译
- C++拾遗
- java编程思想笔记--内部类部分七
- 【Cocos2d-X开发学习笔记】第11期:时间调度schedule函数的使用