Codeforces Round #309 (Div. 2) B. Ohana Cleans Up

题目链接:http://codeforces.com/contest/554/problem/B

#include <iostream>
#include <string>
#include <cmath>
using namespace std;

int main()
{
    int ans=0,m;
    while(cin>>m)
    {
        string s[105];
        for(int i=0; i<m; i++)
           cin>>s[i];
        for(int i=0; i<m; i++)
        {
            int sum=0;
            for(int j=0; j<m; j++)
                if(s[i] == s[j])
                  sum++;
            ans=max(ans,sum);
        }
        cout<<ans<<endl;
    }
    return 0;
}