HDU 1004

et the Balloon Rise


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<stdio.h>  #include<string.h>  int main(){int n, i, j, sum, max, flag;char a[1009][99];while (~scanf("%d", &n), n){max = flag = 0;for (i = 0; i<n; i++)scanf("%s", a[i]);for (i = 0; i<n; i++){sum = 0;for (j = i + 1; j<n; j++){if (strcmp(a[i], a[j]) == 0)//比较两个字符串,当s1<s2时，返回为负数；当s1 = s2时，返回值 = 0；当s1>s2时，返回正数。sum++;}if (max<sum) //{max = sum;flag = i;//将最大字符串的坐标赋值给flag}}puts(a[flag]);}return 0;}