[알고리즘 문제풀이] 백준 4673 셀프 넘버 /JAVA

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

4673번: 셀프 넘버

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        int [] numbers = new int[10001];

        int num = 1;

        while(num <10000){
            int sum = num;
            int num2 = num;
            while(num2 > 0){
                sum += num2 % 10;
                num2 /= 10;
            }
            if (sum <= 10000){
                numbers[sum] = 1;
            }
            num += 1;
        }
        for(int i = 1; i<=10000; i++){
            if(numbers[i] == 0){
                System.out.println(i);
            }
        }
    }
}