• 문제 링크
https://www.acmicpc.net/problem/9182
• 풀이 코드
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 = 1, p;
while ((p = read()) != -1) {
int e = read(), i = read(), d = read(), D = d++;
while ((d - p) % 23 != 0 || (d - e) % 28 != 0 || (d - i) % 33 != 0) d++;
sb.append("Case ").append(t++).append(": the next triple peak occurs in ").append(d - D).append(" days.\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' 카테고리의 다른 글
[백준] 22282 H-Index - Brute Force / Java (0) | 2025.07.22 |
---|---|
[백준] 16960 스위치와 램프 - Brute Force / Java (0) | 2025.07.21 |
[백준] 30306 Better Dice - Brute Force / Java (0) | 2025.07.19 |
[백준] 33691 Arkain 대시보드 - Data Structure / Java (0) | 2025.07.18 |
[백준] 34033 공금 횡령 - Data Structure / Java (0) | 2025.07.17 |
댓글