• 문제 링크
https://www.acmicpc.net/problem/25270
• 풀이 코드
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));
bw.write(String.valueOf(find(read())));
bw.flush();
}
private static int find(int n) {
int m = n;
while (true) {
if (++n % 100 == 99) return n;
if (--m > 0 && m % 100 == 99) return m;
}
}
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' 카테고리의 다른 글
[백준] 8658 Liczba - Brute Force / Java (0) | 2024.11.16 |
---|---|
[백준] 16625 Das Blinkenlights - Brute Force / Java (0) | 2024.11.15 |
[백준] 2061 좋은 암호 - Brute Force / Java (0) | 2024.11.13 |
[백준] 27962 오렌지먹은지오랜지 - Brute Force / Java (0) | 2024.11.12 |
[백준] 15832 Aku Negaraku - Data Structure / Java (0) | 2024.11.11 |
댓글