DFS

DFS

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

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 <stdio.h>
#include <string.h>
int jc(char c)
{
	int n=c-48;
	int sum=1;
	for (int i=1;i<=n;i++)
	{
          sum*=i;
	}
	return sum;
}
int main()
{
	int stl,sum;
	char str[12];
	for (int i=1;i<=2147483;i++)
	{
		sum=0;
		sprintf(str,"%d",i);
		stl=strlen(str);
		for (int j=0;j<stl;j++)
		{
            sum+=jc(str[j]);
		}
		if (sum==i)
		{
			printf("%d\n",i);
		}
	}
	
}

这道题很贱，如果你要去算，必须超时，所以我们应该现在本地计算机运行之后看结果，看看范围到底有多大之后，缩小范围即可！最红要的这一题运用了字符串与数字之间的交换！

具体请看1字符串与数字之间的交换