zoukankan      html  css  js  c++  java
  • hdu 1004 Let the Balloon Rise

    Let the Balloon Rise

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 74110    Accepted Submission(s): 27711


    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
     
     
    字符串的比较:两个数组color[1005][16]和num[1005]。数组color是用来保存颜色的,数组num是用来保存颜色出现的次数,最后求出数组num中最大的数的下标即为出现次数最多的颜色。
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 using namespace std;
     5 char color[1005][16];
     6 int num[1005];
     7 int main()
     8 {
     9     int n, i, j, max;
    10     while(scanf("%d",&n) && n)
    11     {
    12         for (i=0; i<n; i++)
    13             scanf("%s",&color[i]);
    14         for(i=0; i<1005; i++)
    15             num[i] = 0;
    16         for(i=1; i<n; i++)
    17             for(j=0; j<i; j++)
    18                 if(strcmp(color[i],color[j])==0)
    19                     num[i]++;
    20         max = 0;
    21         j = 0;
    22         for(i=0; i<n; i++)
    23             if (max<num[i])
    24             {
    25                 max = num[i];
    26                 j = i;
    27             }
    28         printf("%s
    ",color[j]);
    29     }
    30     return 0;
    31 }
    View Code
  • 相关阅读:
    2016.07.24
    这个月
    PL/SQL: numeric or value error: character to number conversion error
    java下double相乘精度丢失问题
    Oracle中实现find_in_set
    oracle中,改变表名和字段名的大小写
    Unknown entity XXX
    Incorrect column count: expected 1, actual 5
    负数的二进制表示
    【Android】Android单例模式及使用单例模式实现自己的HttpClient工具类
  • 原文地址:https://www.cnblogs.com/yazhou/p/3916800.html
Copyright © 2011-2022 走看看