POJ1316-Self number

Self Numbers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 21412		Accepted: 12037

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

这道题，刚开始我不会。翻译都没有看懂。就直接做了。以为只是每个数加11.结果并不是。

这道题的意思是输出。1-10000内的一种数。（这种数加自己数，大致意思就是跟题里描述的差不多，除了本身，没有任意数加上这个任意数的每一位之和）；说的可能不怎么准确。可以看下题。69=57+5+7；所以69不是这种数。

解题思路：

先定义一个数组，将它全部标记成他的下标。然后一个for循环；

定义一个d=i，j=i；然后将j拆分加给d，如果d<=10000；就把a[d]标记成0；

然后输出就可以了；

代码如下：

#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
    int a[10005],i;
    for(i=0;i<=10000;i++)
    {
        a[i]=i;
    }
    for(i=0;i<=10000;i++)
    {
        int j=i;
        int d=i;
        while(j)
        {
            d+=j%10;
            j/=10;
        }
        if(d<=10000)
            a[d]=0;
    }
    for(i=0;i<10001;i++)
    {
        if(a[i]!=0)
            printf("%d\n",a[i]);
    }
    return 0;
}