• 문제 링크
https://www.acmicpc.net/problem/4619
• 풀이 코드
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 b;
while ((b = read()) != 0) {
int n = read();
double a = Math.pow(b, 1.0 / n);
int l = (int) Math.floor(a), r = (int) Math.ceil(a);
sb.append(b - Math.pow(l, n) < Math.pow(r, n) - b ? l : r).append("\n");
}
bw.write(sb.toString());
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' 카테고리의 다른 글
[백준] 9288 More Dice - Brute Force / Java (0) | 2024.10.28 |
---|---|
[백준] 6975 Deficient, Perfect, and Abundant - Brute Force / Java (0) | 2024.10.27 |
[백준] 27590 Sun and Moon - Brute Force / Java (0) | 2024.10.25 |
[백준] 24817 Competitive Arcade Basketball - Data Structure / Java (0) | 2024.10.24 |
[백준] 8669 Las - Data Structure / Java (0) | 2024.10.23 |
댓글