2.2 筛选法模拟

Self Numbers

Description

In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d stands for digitadition, a term coined by Kaprekar.) For example, d(75) = 75 + 7 + 5 = 87. Given any positive integer n as a starting point, you can construct the infinite increasing sequence of integers n, d(n), d(d(n)), d(d(d(n))), .... For example, if you start with 33, the next number is 33 + 3 + 3 = 39, the next is 39 + 3 + 9 = 51, the next is 51 + 5 + 1 = 57, and so you generate the sequence  

33, 39, 51, 57, 69, 84, 96, 111, 114, 120, 123, 129, 141, ...  
The number n is called a generator of d(n). In the sequence above, 33 is a generator of 39, 39 is a generator of 51, 51 is a generator of 57, and so on. Some numbers have more than one generator: for example, 101 has two generators, 91 and 100. A number with no generators is a self-number. There are thirteen self-numbers less than 100: 1, 3, 5, 7, 9, 20, 31, 42, 53, 64, 75, 86, and 97.  

Input

No input for this problem.

Output

Write a program to output all positive self-numbers less than 10000 in increasing order, one per line.

Sample Input

Sample Output

1
3
5
7
9
20
31
42
53
64
 |
 |       <-- a lot more numbers
 |
9903
9914
9925
9927
9938
9949
9960
9971
9982
9993

c：

#include<stdio.h>
int main(){
int num[10000];
int i=0;
for(i=0;i<10000;i++){
    num[i]=i;
}

int sum=0;
        for(i=0;i<10000;i++){
            if(i<10){
                sum=i+i;

            }else if(i<100){
                sum=i+i/10+i%10;

            }else if(i<1000){
                sum=i+i/100+(i%100)/10+i%10;

            }else if(i<10000){
                sum=i+i/1000+(i%1000)/100+(i%100)/10+i%10;

            }
            if(sum<10000){
                num[sum]=0;
            }
        }
        for(i=0;i<10000;i++){
                if(num[i]!=0)
                    printf("%d\n",num[i]);
        }
        return 0;
        }
java：

package data20180305;

import java.util.ArrayList;
import java.util.List;

public class SelfNumbers {
    public static void main(String[] args) {
        List<Integer> list = new ArrayList<>();
        for(int i=0;i<10000;i++){
            list.add(i);
        }
        int sum=0;
        for(int i=0;i<10000;i++){
            if(i<10){
                sum=i+i;
    
            }else if(i<100){
                sum=i+i/10+i%10;
                
            }else if(i<1000){
                sum=i+i/100+(i%100)/10+i%10;
            
            }else if(i<10000){
                sum=i+i/1000+(i%1000)/100+(i%100)/10+i%10;
                
            }
            if(sum<10000){
                list.set(sum, 0);
            }
        }
        for(int i=0;i<list.size();i++){
            if(list.get(i)!=0){
                System.out.println(list.get(i));
            }
            
        }
    }
}

zoj上要求求1000000以内的，数据量大，java改成求1000000之后Judge Internal Error，c改成1000000之后也会栈溢出，因此便在poj上ac。