被嘲笑没有智商的题

Problem F
Time Limit: 2000 MS Memory Limit: 32 MB 64bit IO Format: %I64d
Submitted: 93 Accepted: 42
[Submit][Status][Web Board]
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
……

唉。。。我的智商确实堪忧啊，这道题一看就知道，符合条件的没有几个，在本机用暴力算出来，然后在代码中把符合条件的数直接输出，不就得了。