HDU_2212

其实printf输出4个数就行。。

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

#include <cstdio>
#include <ctime>
int fun(int n)
{
   int s=1;
   for(int i=2;i<=n;i++)
      {
         s=s*i;
      }
   return s;   
}
int main()
{
   int s,n,r;
   for(int i=1;i<=40585;i++)
      {
         s=0;n=i;
         while(n)
            {
               r=n%10;
               n=n/10;
               s=s+fun(r); 
            }
         if(s==i)
            printf("%d\n",i);  
      }
}