• 문제 링크
https://www.acmicpc.net/problem/15122
• 풀이 코드
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 n = read() + 1;
while (contains(n)) n++;
bw.write(String.valueOf(n));
bw.flush();
}
private static boolean contains(int i) {
do if (i % 10 == 0) return true; while ((i /= 10) > 0);
return false;
}
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' 카테고리의 다른 글
[백준] 10312 Lodê - Greedy / Java (0) | 2024.07.10 |
---|---|
[백준] 27849 Hungry Cow - Greedy / Java (0) | 2024.07.09 |
[백준] 15779 Zigzag - Brute Force / Java (0) | 2024.07.07 |
[백준] 9196 정수 직사각형 - Brute Force / Java (0) | 2024.07.06 |
[백준] 30189 경우의 수의 합 - Brute Force / Java (0) | 2024.07.05 |
댓글