B. Ohana Cleans Up
来源:互联网 发布:linux下system函数 编辑:程序博客网 时间:2024/05/16 23:57
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.
解题说明:此题是一道模拟题,由于数据量不大,可以用暴力的方法来做,为了找到行全为1时最多的数目,可以先找到当前数字一样的情况下最多的行数,这样在修改过程中这些行都会发生统一的改变。通过修改列,这些行最终都能实现全为1.
#include<stdio.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;int main(){char s[105][105];int n,i,max=0,c,j,k;scanf("%d",&n);for(i=0;i<n;i++){scanf("%s",s[i]);}for(i=0;i<n;i++){c=0;for(j=i+1;j<n;j++){for(k=0;k<n;k++){if(s[i][k]==s[j][k]){continue;}else{break;}}if(k==n){c++;}}if(c>max){max=c;}}printf("%d\n",max+1);return 0;}
- B. Ohana Cleans Up
- codeforces 554B B. Ohana Cleans Up
- Codeforces 554B Ohana Cleans Up
- #309 (div.2) B. Ohana Cleans Up
- CF 554B Ohana Cleans Up
- codeforces 554B Ohana Cleans Up
- CodeForces-554B Ohana Cleans Up
- CF 554B Ohana Cleans Up
- coderforce 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
- Ohana Cleans Up cf-554B【思维】
- Codeforces554B:Ohana Cleans Up
- java内存分配和String类型的深度解析
- android编译openssl静态库.a
- hdu 5299(树上删边游戏) Circles Game
- python设计模式之命令调度模式
- dlopen failed: "*.so" has unexpected e_machine
- B. Ohana Cleans Up
- 欢迎使用CSDN-markdown编辑器
- Java数据库操作-----出现错误
- python设计模式之抽象工厂模式
- windows查看被占用端口
- 下载android源码的简单方法
- python设计模式之状态模式
- 20个实用的webApp前端开发技巧
- 架构师速成6.7-设计开发思路-uml