hdu 2212 DFS *

DFS

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

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

 

2147483647各个位上阶乘的和 是最大是1*9*9！这样来求解。999999999   9个9 最大的各个位上的阶乘的和为3265920=9*9！

只需要遍历到上面这个数就可以了，不用遍历到21亿，否则会超时

#include<stdio.h>
#include <iostream>
using namespace std;
int f(int n)
{
    int sum=1;
    for (int i=1; i<=n; i++)
    {
        sum*=i;
    }
    return sum;
}
int main()
{
    int ans[10];
    ans[0]=1;
    for (int i=1; i<=9; i++)
    {
        ans[i]=f(i);
    }
    for (int i=1; i<=3265920; i++)
    {
        int num=i;
        int sum=0;
        while (num)
        {
            int j=num%10;
            num/=10;
            sum+=ans[j];
        }
        if(i==sum)
        {
            cout<<i<<endl;
        }
    }
}