Problem Solving/Baekjoon
[백준] 6815 Cool Numbers - Brute Force / Java
graycode
2025. 11. 14. 16:20
• 문제 링크
https://www.acmicpc.net/problem/6815
• 풀이 코드
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 a = read(), b = read(), i = 1, j, cnt = 0;
while ((j = i * i * i * i * i * i++) <= b) if (j >= a) cnt++;
bw.write(String.valueOf(cnt));
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;
}
}
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 a = read(), b = read(), i = 1, j, cnt = 0;
while ((j = i * i * i++) <= b) if (j >= a && (int) Math.sqrt(j) == Math.sqrt(j)) cnt++;
bw.write(String.valueOf(cnt));
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;
}
}