DFS number

妹子们 汉子们 大家努力的切题啊!!!!

 
DFS 

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

Total Submission(s) : 12   Accepted Submission(s) : 5

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

这道题是个很有趣的题，简单的模拟肯定会超时的所以需要特殊的办法！(*^__^*) 嘻嘻

因为答案只有四个数所以只要直接输出那四个数即可。

代码：

#include<iostream>
using namespace std;
int main()
{ 
    printf("1%\n");
    printf("2%\n");
    printf("145%\n");
    printf("40585%\n");
}