• 문제 링크
https://www.acmicpc.net/problem/6491
• 풀이 코드
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 n;
while ((n = read()) != 0) {
int sum = 0;
for (int i = 1; i < n; i++) if (n % i == 0) sum += i;
sb.append(n).append(sum < n ? " DEFICIENT\n" : sum == n ? " PERFECT\n" : " ABUNDANT\n");
}
bw.write(sb.toString());
bw.flush();
}
private static int read() throws IOException {
int c = System.in.read();
while (c <= 32) c = System.in.read();
int n = c & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 11328 Strfry - Implementation / Java (0) | 2024.10.31 |
---|---|
[백준] 6779 Who Has Seen The Wind - Brute Force / Java (0) | 2024.10.30 |
[백준] 9288 More Dice - Brute Force / Java (0) | 2024.10.28 |
[백준] 6975 Deficient, Perfect, and Abundant - Brute Force / Java (0) | 2024.10.27 |
[백준] 4619 루트 - Brute Force / Java (0) | 2024.10.26 |
댓글