HDU2212

1）名字叫dfs，然而并不是用dfs。

水的不得了，不应该浪费太多时间去想复杂算法，名字是来迷惑的；首先将0！~9！打表方便多次调用；实际上只要看到最大值：9！=362880，那么假设十个数都是9！那么所能到达的最大和也就是3628800，那么循环只要检测到1~3628800即可；这种看到不需要输入的题，也可以先用程序将所有答案暴力搜出，然后写个输出程序将找到的答案输出即可。

#include <iostream>
#include <string.h>
//#include <stdlib.h>
#include <stdint.h>  //int64_t的头文件
using namespace std;
long long int sun=0;
int db[13];
long long int dfs(long long int num){

    sun+=db[num%10];
    if(num/10){
        long long int g=dfs(num/10);
    }
    return sun;
}
int main()
{

    db[0]=1;
    for(int i=1;i<=9;i++){
        db[i]=db[i-1]*i;
    }
    long long int sum=1;
    for(long long int i=1;i<=3628800;i++){
        //int64_t weishu=10;
        //r =i%10;
        if(i%10==0){
            //weishu*=10;
            sun=0;
            sum=dfs(i);
            if(sum==i)
                cout<<i<<endl;

        }
        else{
            sum=sum-db[(i-1)%10]+db[i%10];
            if(sum==i)
                cout<<i<<endl;
        }
    }
    //cout<<db[9]<<endl;
    //cout<<"s"<<endl;
    return 0;
}

2）

DFS

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

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
......