【CodeForces】554B - Ohana Cleans Up(思维)
来源:互联网 发布:淘宝精密管 编辑:程序博客网 时间:2024/06/06 01:56
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.
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.
The output should be a single line containing an integer equal to a maximum possible number of rows that are completely clean.
40101100011110101
2
3111111111
3
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。
题解:想明白了其实就是看看有横行相同的行数最多,求这个最大值而已。
代码如下:
#include<cstdio>char map[120][120];int main() {int n;while(~scanf("%d",&n)) {getchar();for(int i=0; i<n; i++) {for(int j=0; j<n; j++) {scanf("%c",&map[i][j]);}getchar();}int max=1;for(int i=0; i<n; i++) {int cnt=1;for(int j=i+1; j<n; j++) {int p;for(p=0; p<n; p++) {if(map[i][p]!=map[j][p])break;}if(p>=n)cnt++;}if(cnt>max)max=cnt;}printf("%d\n",max);}return 0;}
- 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 【思维+map】
- Ohana Cleans Up cf-554B【思维】
- codeforces 554B B. 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
- 【59.49%】【codeforces 554B】Ohana Cleans Up
- CodeForces - 554B Ohana Cleans Up (模拟)水
- 【Codeforces】-554B-Ohana Cleans Up(水)
- django缓存优化 Redis缓存介绍
- ACM 砖块计数
- Android Studio 下载 使用教程
- OpenCV3.1 Windows下新建工程
- mysql常见问题
- 【CodeForces】554B - Ohana Cleans Up(思维)
- VS2012+NShader1.3
- 用MyEclipse6.5但是在添注册码时老是不能进行finish这一步 The subscription code is not a Blue edition code.
- acm 2 1016 Red and Black
- 裸板程序--韦东山第4课 MMU实验
- 点击TR改变input的checked
- 微软良心之作——Visual Studio Code 开源免费跨平台代码编辑器
- 阿里云CentOS图形化装Oracle实例教程(附小技巧)
- Windows8系统安装 -Windows无法安装到这个磁盘