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

B. Ohana Cleans Up

 

Ohana Matsumae is trying to clean a room, which is divided up into an n by n grid of squares. Each square is initially either clean or dirty. Ohana can sweep her broom over columns of the grid. Her broom is very strange: if she sweeps over a clean square, it will become dirty, and if she sweeps over a dirty square, it will become clean. She wants to sweep some columns of the room to maximize the number of rows that are completely clean. It is not allowed to sweep over the part of the column, Ohana can only sweep the whole column.

Return the maximum number of rows that she can make completely clean.

Input

The first line of input will be a single integer n (1 ≤ n ≤ 100).

The next n lines will describe the state of the room. The i-th line will contain a binary string with n characters denoting the state of the i-th row of the room. The j-th character on this line is '1' if the j-th square in the i-th row is clean, and '0' if it is dirty.

Output

The output should be a single line containing an integer equal to a maximum possible number of rows that are completely clean.

Sample test(s)

input

40101100011110101

output

2

input

3111111111

output

3

Note

In the first sample, Ohana can sweep the 1st and 3rd columns. This will make the 1st and 4th row be completely clean.

In the second sample, everything is already clean, so Ohana doesn't need to do anything.

 

题意：每次改变一列的值（0变1，1变0）问最后最大有多少行全为1；

思路：不需要管全一或者全零因为他们是可以相互转换的，所以只要比较初始状态，每行状态，取最多的就好了；

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

转载请注明出处：寻找&星空の孩子

 

#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;char a[105][105];int main(){    int n,i,j,ans = 0;    scanf("%d",&n);    for(i = 0;i<n;i++)    {        scanf("%s",a[i]);    }    for(i = 0;i<n;i++)    {        int  s = 0;        for(j = 0;j<n;j++)        {            if(strcmp(a[i],a[j])==0)                s++;        }        ans = max(ans,s);    }    printf("%d\n",ans);}