hdu 1128 Self Numbers

Self Numbers

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6248    Accepted Submission(s): 2736

Problem 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. 


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

 

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
|
|
|
  
  

 

题目大意： 一个数n,比如n=75,或者n=39，则n可以根据下面这种规则生成87与51这两个数，所以87跟51这两个数就不是self number,而当有一个数不能由其他数根据这种方法生成过来的时候，这个数就称为self number. d(75) = 75 + 7 + 5 = 87 d(39) = 39 + 3 + 9 = 51。

#include <iostream>
using namespace std;
int Hash[1000010];
int main()
{
    for (int i=1; i<= 1000000; i++)
    {
        Hash[i]=i;
    }
    for (int i=1; i<= 1000000; i++)
    {
        int sum=i;
        int k=i;
        while (k)
        {
            sum+=k%10;
            k/=10;
        }
        Hash[sum]=0;
    }
    for (int i=1; i<= 1000000; i++)
    {
        if(Hash[i])
        {
            cout<<Hash[i]<<endl;
        }
    }
    return 0;
}