CodeForces 554BOhana Cleans Up（思维）

Description
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 Input
Input
4
0101
1000
1111
0101
Output
2
Input
3
111
111
111
Output
3
Hint
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.

题意：一个人清扫屋子，他一次只能清扫一列，清扫后干净的房间会变脏，脏的房间会变干净，问你怎么清扫可以使最多行全部干净，输出干净的最多行数。

思路：乍一看就是想判断每行有几个房间是脏的，然后输出最多相同脏的房间的行数就好了，然而虽然脏的个数相同，位于列的位置不同。后来想了想，直接找到最多相同的序列，那么使他们都干净的清扫方式也相同，直接输出即可。

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
using namespace std;
int main()
{
	int n;
	char map[101][101];
	int a[101];
	while(~scanf("%d",&n))
	{
		memset(map,0,sizeof(map));
		memset(a,0,sizeof(a));
		for(int i=0;i<n;i++)
		scanf("%s",map[i]);
		for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		{
			if(strcmp(map[i],map[j])==0)
			a[i]++;
		}
		sort(a,a+n);
		printf("%d\n",a[n-1]);
	}
	return 0;
}