cf554B Cleans Up
来源:互联网 发布:知乐的肉小说有哪些 编辑:程序博客网 时间:2024/06/06 01:18
Codeforces554B:Ohana Cleans Up
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.
代码:
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;char a[105][105];int main(){ int n,i,j,ans = 0; scanf("%d",&n); for(i = 0;i<n;i++) { scanf("%s",a[i]); } for(i = 0;i<n;i++) { int s = 0; for(j = 0;j<n;j++) { if(strcmp(a[i],a[j])==0) s++; } ans = max(ans,s); } printf("%d\n",ans);}
11.19工作室第三次淘汰赛C题;
当时想到了要找重复最多次的行;
但是用int数组不能实现,没想到用char数组;
(输入的时候每个数字之间并无空格,所以肯定不能用int输入~)
- cf554B Cleans Up
- how JScript cleans up
- Codeforces554B:Ohana Cleans Up
- B. Ohana Cleans Up
- Ohana Cleans Up
- Ohana Cleans Up
- Ohana Cleans Up
- Ohana Cleans Up
- 【codeforces】Ohana Cleans Up
- Ohana Cleans Up
- Ohana Cleans Up CodeForces
- Ohana Cleans Up
- Ohana Cleans Up
- CodeForces 554BOhana Cleans Up
- CodeForces 554BOhana Cleans Up
- Codeforces 554B Ohana Cleans Up
- #309 (div.2) B. Ohana Cleans Up
- CF 554B Ohana Cleans Up
- 11-20学长讲课我的草稿
- JavaScript趣题:字符串是否由字母或数字组成?
- 理解复杂的c语言 c++声明
- about hibernate
- MyEclipse+tomcat手动发布web项目
- cf554B Cleans Up
- oracle系统权限
- 【编程开发】MD5算法原理
- Java设计模式之——单例模式
- 解释型语言与编译型语言
- 2016.11.19
- 数据结构——图知识概要
- poj1979 dfs水题
- 子网掩码、最大主机、最大子网数的计算