HDU 1004 模擬

#include<iostream>
#include<cstdlib>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<queue>
#include<string>
#include<string.h>
#include<map>
using namespace std;
#define MAXN 100000
int prime[MAXN];//第i個素數
bool isprime[MAXN + 10];//is_pri[i]表示i是素數
                       //返回n以內素數的個數
int sieve(int n) {
    int p = 0;
    for (int i = 0;i <= n;i++)isprime[i] = true;
    isprime[0] = isprime[1] = false;
    for (int i = 2;i <= n;i++) {
        if (isprime[i]) {
            prime[++p] = i;
            for (int j = 2 * i;j <= n;j += i)isprime[j] = false;
        }
    }
    return p;
}
int main()
{
    char ballon[1000][16];
    int n,i,j;
    int num[1000];
    while (cin >> n, n)
    {
        num[0] = 0;
        cin >> ballon[0];
        for (i = 1;i < n;i++)
        {
            num[i] = 0;
            cin >> ballon[i];
            for (int j = 0;j < i - 1;j++)
            {
                if (strcmp(ballon[i], ballon[j]) == 0)
                    num[i]++;
            }
        }
        int max = 0, t = 0;
        for (int i = 1;i < n;i++)
        {
            if (max < num[i])
            {
                max = num[i];
                t = i;
            }
        }
        cout << ballon[t] << endl;
    }

    
}