zoukankan      html  css  js  c++  java
  • hdu1004: Let the Balloon Rise

    http://acm.hdu.edu.cn/showproblem.php?pid=1004

    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 <bits/stdc++.h>
    using namespace std;
    int main()
    {
    	int n, i, maxi;
    	char str[20], ans[20];
    	unordered_map<string, int> a;
    	while(scanf("%d", &n), n!=0)
    	{
    		a.clear();	
    		maxi=0;
    		while(n--)
    		{
    			scanf("%s", str);
    			a[str]++;
    			if(a[str]>maxi)
    			{
    				maxi=a[str];
    				strcpy(ans, str);
    			}
    		}
    		printf("%s
    ", ans);
    	}
    	return 0;	
    } 
  • 相关阅读:
    Appium(一)安装
    Adb am/pm的使用
    RESTful API 设计指南
    选择物体生成Prefab
    C++网络开发Boost库
    Unity 猫眼效果
    React Native网络请求
    Unity高德LBS
    EasyTouch物体的旋转缩放
    Unity截屏分享朋友圈(微信)
  • 原文地址:https://www.cnblogs.com/zyq1758043090/p/11852678.html
Copyright © 2011-2022 走看看