hdu 2212

DFS

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3377    Accepted Submission(s): 2042

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

 

Recommend

lcy

先求出这几个数，该程序直接提交会超时。

#include <stdio.h>
int A(int n)
{
	int r = 1;
	while(n > 0)
		r *= n--;
	return r;
}
int DFS(int n)
{
	int r = 0, t;
	while (n > 0)
	{
		t = n % 10;
		r += A(t);
		n /= 10;
	}
	return r;
}
int main()
{
	int i;
	for (i = 1; i <= 2147483647; i++)
	{
		if(i == DFS(i))
			printf("%d\n", i);
	}
	return 0;
}

然后再直接将这几个数输出就能ac：

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