CodeForces 554BOhana Cleans Up
来源:互联网 发布:张伯伦生涯数据 编辑:程序博客网 时间:2024/04/29 23:23
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
40101100011110101
2
3111111111
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.
这道题就是求相同的个数,N只到100,遍历就行。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char map[110][110];int main(){int n,i,j,row,cnt;while(scanf("%d",&n)!=EOF){memset(map,0,sizeof(map));row=0;for(i=0;i<n;i++)scanf("%s",map[i]);for(i=0;i<n;i++){cnt=0;for(j=0;j<n;j++){if(strcmp(map[i],map[j])==0)cnt++;}row=max(row,cnt);}printf("%d\n",row);}return 0;}
- CodeForces 554BOhana Cleans Up
- CodeForces 554BOhana Cleans Up
- CodeForces 554BOhana Cleans Up(思维)
- Codeforces 554B Ohana Cleans Up
- codeforces 554B Ohana Cleans Up
- CodeForces-554B Ohana Cleans Up
- Codeforces 554B Ohana Cleans Up 【水题】
- CodeForces 554B. Ohana Cleans Up【思维】
- 【codeforces 554B Ohana Cleans Up】
- CodeForces 554B Ohana Cleans Up
- CodeForces 554B Ohana Cleans Up
- CodeForces 554B Ohana Cleans Up
- codeforces 554B B. Ohana Cleans Up
- 【59.49%】【codeforces 554B】Ohana Cleans Up
- 【codeforces】Ohana Cleans Up
- Ohana Cleans Up CodeForces
- Codeforces 554B Ohana Cleans Up 扫房间
- CodeForces - 554B Ohana Cleans Up (模拟)水
- [2016/8/23][C语言]main函数的参数
- 大数据IMF传奇行动绝密课程第36课:TaskScheduler内幕天机解密
- mysql varchar和char类型在不同字符集下的字符数和字节数计算
- CodeForces 632B Co-prime Array 【GCD(互质)】
- Android桌面悬浮窗效果实现,仿360手机卫士悬浮窗效果
- CodeForces 554BOhana Cleans Up
- 安卓获取状态栏(Status Bar)高度
- CentOS-创建yum本地源
- HDU 1317 一路wa到西天
- CodeForces 660A Co-prime Array
- Redis学习(二)
- poj1321 dfs
- centos下LNMP网站应用环境的部署
- Unity Shader种类