Skip to content

Commit b0750d2

Browse files
authored
Merge pull request #1363 from AlgorithmWithGod/Seol-JY
[20251109] BOJ / G4 / 램프 / 설진영
2 parents 20e55f7 + a31f9d4 commit b0750d2

File tree

1 file changed

+46
-0
lines changed

1 file changed

+46
-0
lines changed
Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
public static void main(String[] args) throws IOException {
7+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
8+
StringTokenizer st = new StringTokenizer(br.readLine());
9+
10+
int N = Integer.parseInt(st.nextToken());
11+
int M = Integer.parseInt(st.nextToken());
12+
13+
String[] rows = new String[N];
14+
for (int i = 0; i < N; i++) {
15+
rows[i] = br.readLine();
16+
}
17+
18+
int K = Integer.parseInt(br.readLine());
19+
20+
Map<String, Integer> patternCount = new HashMap<>();
21+
for (String row : rows) {
22+
patternCount.put(row, patternCount.getOrDefault(row, 0) + 1);
23+
}
24+
25+
int maxRows = 0;
26+
27+
for (Map.Entry<String, Integer> entry : patternCount.entrySet()) {
28+
String pattern = entry.getKey();
29+
int count = entry.getValue();
30+
31+
int zerosCount = 0;
32+
for (char c : pattern.toCharArray()) {
33+
if (c == '0') {
34+
zerosCount++;
35+
}
36+
}
37+
38+
if (zerosCount <= K && (K - zerosCount) % 2 == 0) {
39+
maxRows = Math.max(maxRows, count);
40+
}
41+
}
42+
43+
System.out.println(maxRows);
44+
}
45+
}
46+
```

0 commit comments

Comments
 (0)