HDU 2212 DFS

DFS

Time Limit : 5000/2000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 37   Accepted Submission(s) : 18

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

Author

zjt

<pre name="code" class="cpp">#include<iostream>
#include<stdio.h>
#include<cmath>
#include<string.h>
#include<string>
#include<queue>
#include<stack>
#include<vector>
using namespace std;

int Factorial[11];
int i,j,k,sum;

int Fact(int n)
{
    int result=1;
    for(i=1;i<=n;i++)
        result*=i;
    return result;
}

int main()
{
    for(int i=0;i<=9;i++)
    {
        Factorial[i]=Fact(i);

    }
    for(i=1;i<=362880;i++)     //9！*10=3628800
    {
        int t=i;
        int sum=0;
        while(t)
        {
            int Mod=t%10;
            sum+=Factorial[Mod];
            t/=10;
        }
        if(i==sum)
            cout<<i<<endl;
    }
    return 0;
}