hdu 2212 DFS

DFs

Problem Description

A DFS(digital factorial sum) number is found by summing the factorial of every digit of a positive integer. 

For example ,consider the positive integer 145 = 1!+4!+5!, so it's a DFS number.

Now you should find out all the DFS numbers in the range of int( [1, 2147483647] ).

There is no input for this problem. Output all the DFS numbers in increasing order. The first 2 lines of the output are shown below.

Input

no input

Output

Output all the DFS number in increasing order.

Sample Output

1
2
......

解析：简单题,就是给一个数n求它的各位数的阶乘的和是否等于它自己。

注意:0的阶乘为1；首先打表将0到9每个数的阶乘求出来放到一个一维数组中，来节省时间。题中给的一个整数2147483647如果用它作为循环肯定超时，但仔细想一下，9的阶乘是362880。如果十位数都是9的话这个和也只有3628800.所以循环时只需要循环到7位数。

#include"stdio.h"
int a[10]={1,1,2,6,24,120,720,5040,40320,362880};
int main()
{
int i,t,temp;
    int sum;
for(i=1;i<=9999999;i++)
       {sum=0;
       int n=i;
        while(n)
         {
        t=n%10;
    sum+=a[t];
    n=n/10;
     }    
      if(sum==i)
printf("%d\n",i);
      }
return 0;
}