杭电1004---Let the Balloon Rise
来源:互联网 发布:gephi数据分析 编辑:程序博客网 时间:2024/05/19 00:15
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.
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
Source
WU, Jiazhi
Recommend
JGShining
分析:第一次做的时候,我对输入的字符串进行排序,刚开始以为排序后容易找那个颜色的次数最多,样例过了,可是一直wrong,这个不能排序,打乱输入的顺序。。。
#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int main(){ string a[1050]; int num[1050]; int n; while(cin>>n) { getchar(); memset(num,0,sizeof(num)); if(n==0) break; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(a[i]==a[j]) num[i]++; } } int max=0; int k=0; for(int i=0;i<n;i++) { if(max<num[i]) { k=i; max=num[i]; } } cout<<a[k]<<endl; } return 0;}
0 0
- 杭电 1004[Let the Balloon Rise]
- 杭电 1004 Let the Balloon Rise
- 杭电 1004 Let the Balloon Rise
- 杭电 1004 Let the Balloon Rise
- 杭电1004 Let the Balloon Rise
- 杭电-1004 Let the Balloon Rise
- 杭电1004---Let the Balloon Rise
- 杭电1004-Let the Balloon Rise
- 【杭电】 1004 Let the Balloon Rise
- 杭电 1004 Let the Balloon Rise
- 杭电1004 Let the Balloon Rise
- [杭电]Let the Balloon Rise
- 杭电Let the Balloon Rise
- 杭电OJ Let the Balloon Rise
- 杭电problem1004- Let the Balloon Rise
- Let the Balloon Rise(杭电ACM 1004)
- 杭电acm 1004 (Let the Balloon Rise)
- 杭电ACM 1004 “+Let+the+Balloon+Rise”
- 利用LD_PRELOAD进行hook
- pat 1064
- static变量的初始化,生存期,作用域
- NYOJ 555 相反输出【简单题】
- hdu 2112 HDU Today Dijkstra算法应用+set集合判重+二分查找。不错的一题
- 杭电1004---Let the Balloon Rise
- C调用lua
- (hdu step 4.2.7)逃离迷宫(在有转弯次数的限制的情况下,判断一个点是否能到另一个点)
- 怎样收集智能数据?
- Codeforces Rockethon 2015 解题报告
- Hello
- 介绍两款大数据清洗工具——DataWrangler、Google Refine
- Java—try catch finally 用法
- NSTimer 实战