HDU2212 DFS 【水题】

DFS

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

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>
#include<algorithm>
using namespace std;
/*
int num[10]={1};	// 0! = 1 零的阶乘等于一！！！ 
void f()
{
    int i,n;
    int ans;
    for(i=1;i<10;i++)
    {
        n=i;
        ans=1;
        while(n)
        {
            ans*=n;
            n--;
        }
        num[i]=ans;
    }
}
int main()
{
    int i;
    int n,m,ans;
    f();
    for(i=1;i<=2147483647;i++)
    {
        n=i;
        ans=0;
        while(n)
        {
            m=n%10;
            ans+=num[m];
            if(ans>i)
            {
                break;
            }
            n/=10;
        }
        if(ans==i)
        {
            printf("%d\n",i);
        }
    }
    return 0;
}
*/
int main()
{
	printf("1\n2\n145\n40585\n");
	return 0;
}