• 문제 링크
https://www.acmicpc.net/problem/13416
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
int t = read();
while (t-- > 0) {
int n = read(), sum = 0, max;
while (n-- > 0) if ((max = Math.max(read(), Math.max(read(), read()))) > 0) sum += max;
sb.append(sum).append('\n');
}
bw.write(sb.toString());
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
boolean flag = n == 13;
if (flag) n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return flag ? ~n + 1 : n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 1331 나이트 투어 - Implementation / Java (0) | 2025.06.16 |
---|---|
[백준] 11575 Affine Cipher - Implementation / Java (0) | 2025.06.15 |
[백준] 3059 등장하지 않는 문자의 합 - Implementation / Java (0) | 2025.06.13 |
[백준] 24755 Election Paradox - Greedy / Java (0) | 2025.06.12 |
[백준] 33520 초코바 만들기 - Greedy / Java (0) | 2025.06.11 |
댓글