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
…

题目大意：一个数=其各位阶乘+十位阶乘+…+

代码：

#include <bits/stdc++.h>
using namespace std;


int jiecheng(int n)
{
    int i,res=1;
    for(i=1;i<=n;i++)
    {
        res=res*i;
    }
    return res;
}

int main()
{
    int sum,i,res;
    for(i=1;i<=3265920;i++)
    {
        res=i;
        sum=0;
        while(res);
        {
            sum+=(jiecheng(res%10));
            res/=10;
        }
        if(sum==i)
        {
             printf("%d\n",i);
        }
    }
}