| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 128 MB | 657 | 377 | 344 | 56.486% |
Colonel Quaritch is playing checkers one day, and decides it would be interesting to write a program to calculate the maximum number of pieces on a single row.
Checkerboards are 8x8 boards with positions between (1,1) and (8,8). The input begins with the number of boards. Each board is on a separate line and begins with the number of pieces, followed by the column and row positions of each piece.
For each checkerboard, your program should output the maximum number pieces on any one row.
정확한 출력 형식은 제출에서 언어를 Java로 설정하면 확인할 수 있다.
2 3 1 1 2 6 8 8 4 2 3 1 3 1 4 5 3
1 3