[백준] 9506번 약수들의 합

[백준] 9506번 약수들의 합 - 자바

문제

해설

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        while(true){
            int n = Integer.parseInt(br.readLine());
            if(n == -1) break;
            int[] yaks = new int[n];
            int cnt = 0;
            int sum = 0;
            for(int i=1; i<n; i++){
                if(n%i == 0) {
                    cnt++;
                    yaks[cnt] = i;
                    sum += i;
                }
            }
            if(n == sum) {
                System.out.print(n + " = 1");
                for(Integer i : yaks){
                    if(i != 0 && i != 1) System.out.print(" + " + i);
                }
                System.out.println();
            }
            else System.out.println(n + " is NOT perfect.");
        }
    }
}