백준9506: 약수들의 합

문제

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

문제 풀이

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int sum = 0;
            ArrayList<Integer> sumList = new ArrayList<>();

            if (n < 0) {
                break;
            }

            for (int i = 1; i <= n - 1; i++) {
                if (n % i == 0) {
                    sum += i;
                    sumList.add(i);
                }
            }

            if (sum == n) {
                System.out.print(n + " = ");
                for (int i = 0; i < sumList.size(); i++) {
                    System.out.print(sumList.get(i));
                    if (i < sumList.size() - 1) {
                        System.out.print(" + ");
                    }
                }
            } else {
                System.out.print(n + " is NOT perfect.");
            }
            System.out.println();
        }
    }
}