0377---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 sequence33, 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 Input

Input

Output

Sample Output

135792031425364|| <-- a lot more numbers|9903991499259927993899499960997199829993|||

CODE：

根据题目意思模拟即可，用数组的下标去实现！用数组对应的值去标记！

#include<iostream>using namespace std;const long long n=1000000;char a[n+9*5]={0};long long f(long long n){long long s=n;while(n){ s+=n%10;         n/=10;}return s;}int main(){  long long i;  for(i=1;i<=n;i++)     a[f(i)]=1;   for(i=1;i<=n;i++)  if(!a[i])  cout<<i<<endl;}