【CodeForces】554B - Ohana Cleans Up(思维)
2016-04-22 08:39
281 查看
B. Ohana Cleans Up
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
input
output
input
output
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。
题解:想明白了其实就是看看有横行相同的行数最多,求这个最大值而已。
代码如下:
#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;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Examples
input
4 0101 1000 1111 0101
output
2
input
3 111 111 111
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。
题解:想明白了其实就是看看有横行相同的行数最多,求这个最大值而已。
代码如下:
#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;
}
相关文章推荐
- 比特币的原理及运作机制
- 裸板程序--韦东山第4课 MMU实验
- 点击TR改变input的checked
- 第2课 GUI程序实例分析
- 用MyEclipse6.5但是在添注册码时老是不能进行finish这一步 The subscription code is not a Blue edition code.
- VS2012+NShader1.3
- OpenCV3.1 Windows下新建工程
- mysql常见问题
- Android Studio 下载 使用教程
- 【移动端debug-4】iOS下setTimeout无法触发focus事件的解决方案
- 剑指offer面试题 实现单例模式
- acm 2 1015 Knight Moves
- 线程安全笔记一则
- 用友U8按BOM计算销售订单物料需求SQL代码 第一稿
- 获取 Android raw 目录下 视频的缩略图
- VxWorks内核解读-1
- constant
- Ubuntu14.04 LTS在VMware虚拟机中设置1080P启动
- 花式GCD
- 花式GCD