首页 > 代码库 > HDU 2212 DFS【列举题】

HDU 2212 DFS【列举题】

将数列举出就可以了

DFS

Time Limit: 5000/2000 MS (Java/Others)    
Memory Limit: 65536/32768 K (Java/Others)


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
 




#include<stdio.h>
int main()
{
	printf("1\n2\n145\n40585\n");
	return 0;
}




HDU 2212 DFS【列举题】