• 문제 링크
https://www.acmicpc.net/problem/1924
• 풀이 코드
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));
int[] arr = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int x = read(), y = read();
while (x-- > 0) y += arr[x];
bw.write(new String[]{"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"}[--y % 7]);
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 5217 쌍의 합 - Implementation / Java (0) | 2025.02.18 |
---|---|
[백준] 1913 달팽이 - Implementation / Java (0) | 2025.02.17 |
[백준] 12603 Store Credit (Small), 12604 Store Credit (Large) - Brute Force / Java (0) | 2025.02.15 |
[백준] 15633 Fan Death - Brute Force / Java (0) | 2025.02.14 |
[백준] 17618 신기한 수 - Brute Force / Java (0) | 2025.02.13 |
댓글