• 문제 링크
https://www.acmicpc.net/problem/33690
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
static int n, cnt = 1;
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
n = read();
for (int i = 1; i < 10; i++) count(i);
bw.write(String.valueOf(cnt));
bw.flush();
}
private static void count(int i) {
long l = i;
while (l <= n) {
l = l * 10 + i;
cnt++;
}
}
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' 카테고리의 다른 글
[백준] 20568 Recess Rocks - Greedy / Java (0) | 2025.07.02 |
---|---|
[백준] 30281 Saldainiai - Greedy / Java (0) | 2025.07.01 |
[백준] 1526 가장 큰 금민수 - Brute Force / Java (0) | 2025.06.29 |
[백준] 14040 Hidden Palindrome - Brute Force / Java (0) | 2025.06.28 |
[백준] 33171 いずれか片方 (Either, but Not Both) - Brute Force / Java (0) | 2025.06.27 |
댓글