Let the Balloon Rise
来源:互联网 发布:公交线路优化调整方案 编辑:程序博客网 时间:2024/06/15 15:52
A - Let the Balloon Rise
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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.
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.
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
5greenredblueredred3pinkorangepink0
Sample Output
redpink
题目意思就是出现最多的颜色,两个数组,一个存颜色,一个计数就好了。
#include<stdio.h>
#include<string.h>
int main(){
int i,count[1001],n,j,t,max,k;
char color[1001][20];
while(scanf("%d",&n)!=EOF&&n!=0){
count[0]=0;
scanf("%s",color[0]);
for(i=1;i<n;i++){
scanf("%s",color[i]);
count[i]=0;
for(j=0;j<i-1; j++){
if(strcmp(color[i], color[j])==0)
count[i]+=1;
}
}
max=0;
t=0;
for(k=1;k<n;k++)
if(max<count[k]){
max =count[k];
t=k;}
printf("%s\n",color[t]);
}}
#include<string.h>
int main(){
int i,count[1001],n,j,t,max,k;
char color[1001][20];
while(scanf("%d",&n)!=EOF&&n!=0){
count[0]=0;
scanf("%s",color[0]);
for(i=1;i<n;i++){
scanf("%s",color[i]);
count[i]=0;
for(j=0;j<i-1; j++){
if(strcmp(color[i], color[j])==0)
count[i]+=1;
}
}
max=0;
t=0;
for(k=1;k<n;k++)
if(max<count[k]){
max =count[k];
t=k;}
printf("%s\n",color[t]);
}}
阅读全文
1 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
- Python 类简要学习
- android 获取动态解析后的html
- MyBatis 中#与$的区别
- Digester 类解析 xml 文件
- python学习笔记之001.py
- Let the Balloon Rise
- 用java实现一颗平衡二叉树ADT
- 装饰器模式
- TCP并发服务器,每个客户一个子进程
- 在 spring mvc 中使用 swagger2
- 用户模式下的线程同步——Slim读/写锁
- JQuery的Ajax跨域请求的解决方案
- javascript写打地鼠
- POJ2139-Six Degrees of Cowvin Bacon