hdoj 1128 Self Numbers

最新推荐文章于 2017-12-09 19:50:00 发布

SimonCoder

最新推荐文章于 2017-12-09 19:50:00 发布

阅读量503

点赞数

分类专栏： # |--hdoj

本文链接：https://blog.csdn.net/SimonCoder/article/details/38119813

版权

|--hdoj 专栏收录该内容

134 篇文章 0 订阅

订阅专栏

http://acm.hdu.edu.cn/showproblem.php?pid=1128

Self Numbers

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

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
|
|
|
  
  
  
  
   
   #include<stdio.h>
#include<string.h>
int a[1000010],b[1000010];
int main()
{
    int i,j,k,n;
    for(i=0;i<1000010;i++)
    {
       a[i]=i;
       b[i]=i;
    }
    for(i=1;i<1000010;i++)
    {  
        char s[10];
        int sum;
        for(k=0;k<10;k++)
        s[k]='\0';
        
        sprintf(s,"%d",a[i]);                  
        n=strlen(s);
        for(j=0,sum=a[i];j<n;j++)                  
        sum+=(s[j]-'0');
        b[sum]=0;

    }
    for(i=1;i<=1000000;i++)
    if(b[i]!=0)
    printf("%d\n",b[i]);
    
    //while(1);
    return 0;
}