[백준] 6975 Deficient, Perfect, and Abundant - Brute Force / Java

• 문제 링크

https://www.acmicpc.net/problem/6975

 

• 풀이 코드

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 t = read();
        while (t-- > 0) {
            int n = read(), sum = 0;
            for (int i = 1; i < n; i++) if (n % i == 0) sum += i;
            sb.append(n).append(" is ").append(sum < n ? "a deficient" : sum == n ? "a perfect" : "an abundant").append(" number.\n\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;
    }

}