[백준 알고리즘] 4673번 셀프 넘버 (Python, Java)

 

 

<Python>

s = set(range(1, 10001))
for i in range(1, 10001):
    sum = i
    for ch in str(i):
        sum += int(ch)

    if sum in s:
        s.remove(sum)

for i in s:
    print(i)

 

<Java>

public class Main {
    public static int calculate( int n) {
        int result = n;

        while (n > 0) {
            result += (n % 10);
            n /= 10;
        }
        return result;
    }

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

        for(int i=1; i<10001; i++) {
            int n = calculate(i);
            if(n<=10000)
                num_arr[n]=1;
        }

        for (int i=1;i< num_arr.length ;i++)
            if(num_arr[i]!=1)
                System.out.println(i);
    }
}

 

▼ 링크

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

4673번: 셀프 넘버