G-self numbers (2.2.1)

G- Self numbers (2.2.1) Time limit:1000MS Memory limit:10000KB 64bit Io format:% I64d & % i64u Submit Status

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 (n )), 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 output

 
135792031425364 | <-- a lot more numbers | 9903991499259927993899499960997199829993
 

 
# Include <iostream> # include <cstring> using namespace STD; int shzi (int K) {int s; S = K; while (s! = 0) {k = K + S % 10; S = s/10;} return K;} int A [10001], n = 10000; int main () {memset (A, 0, sizeof (a); int I, K; for (I = 1; I <= 10000; I ++) {k = shzi (I); If (k <= 10000) A [k] = 1 ;}for (I = 1; I <= 10000; I ++) if (! A [I]) cout <I <Endl; return 0 ;}