DFS
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9252 Accepted Submission(s): 5644
题目链接:点击打开链接
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.
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
......
1
2
......
题意:
在 12147483647 范围内,找出像 145 = 1!+4!+5! 这样的数,就是该数满足各位上数字的阶乘和。
分析:
本题用 for 循环肯定超时,肿么办呢,哈哈哈,你可以先 for 循环让它跑,数肯定不多,跑完之后记录好这些数,直接输出就行,这是最笨的方法,但是也很好玩,代码一就是让它跑数的代码,提交代码二,肯定过啦,哈哈哈哈哈哈哈哈哈。。。。。。
代码一:
#include <iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
int main()
{
int sum,ans,n;
for(int i=1;i<=12147483647;i++)
{
n=i;
sum=0;
while(n)
{
ans=1;
for(int j=1;j<=n%10;j++)
ans*=j;
sum+=ans;
n/=10;
}
if(sum==i)
{
printf("%d\n",i);
}
}
return 0;
}
#include<stdio.h>
int main()
{
printf("1\n2\n145\n40585\n");
return 0;
}