HDU-2212 DFS

DFS

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


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

Author
zjt
 

水题

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <string>
using namespace std;

int f[10];
int t[10];
int sum;
int tmp;

void init(){
    t[0]=1;
    for(int i=1;i<=9;i++){
        t[i]=t[i-1]*i;
    }
}

void fun(int n){
    sum=0;
    tmp=n;
    while(tmp){
        sum+=t[tmp%10];
        tmp/=10;
    }
    if(sum==n){
        cout<<n<<endl;
    }
}

int main(){
    init();
    for(int i=1;i<=10*t[9];i++){
        fun(i);
    }
    return 0;
}


结果如下:

1
2
145
40585



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值