본문 바로가기

알고리즘/Boj

[JAVA] 백준 4673 - 셀프 넘버

 

#flaticon

 

import java.util.*;

public class Main {
	static boolean[] arr = new boolean[10001];
	public static void main(String[] args) {
        for(int i=1; i<10001; i++) {
			if(arr[i] == false)
				solve(i);
		}
		for(int i=1; i<10001; i++) {
			if(arr[i] == false)
				System.out.println(i);
		}
	}
	
	public static void solve(int n) {
		int init = n;
		while(n != 0) {
			init += n % 10;
			n = n / 10;
		}
		if(init == 0 || init > 10000)
			return;
		arr[init] = true;
		solve(init);
	}
}