Self Numbers(POJ--1316

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

思路:跟素数筛差不多,从1到10000直接把非Self Numbers筛去,剩下的即是Self Numbers,普通暴力就能过

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

<span style="font-size:18px;">#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
bool length[10005];
int main()
{
    memset(length,1,sizeof(length));                  //假设所有的数都符合要求
    for(int i=1; i<10005; i++)
    {
        int sum=i,k=i;
        while(k)
        {
            sum+=k%10;
            k=k/10;
        }
        length[sum]=false;                                    //把不符合的筛去
    }
    for(int i=1; i<10000; i++)
        if(length[i])
            printf("%d\n",i);
    return 0;
}</span>