HDU2212 DFS
2016-07-24 13:52
316 查看
DFS
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 inputOutput
Output all the DFS number in increasing order.Sample Output
1 2 ......
——————————————————————————————————————————
名为DFS,实际上没有关系,直接暴力解决。#include <iostream> #include<cstdio> #include<cstring> using namespace std; int main() { int a[10],k,sum,s; a[0]=1; for(int i=1;i<10;i++) { a[i]=1; for(int j=1;j<=i;j++) { a[i]*=j; } } for(int i=1;i<100000;i++) { s=i; sum=0; while(s>0) { k=s%10; sum+=a[k]; s/=10; } if(sum==i) printf("%d\n",i); } return 0; }
相关文章推荐
- 链表分析笔记
- 栈——顺序栈
- Python 之 time模块详解
- HDU1312 Red and Black(DFS)
- Linux环境下Lapack软件包的编译和使用
- BitmapFactory类
- Hadoop无法启动namenode(connect to host olddriver port 22: Connection refused)
- Java中的String、StringBuilder以及StringBuffer区别
- linux命令查询
- javaIO流总结
- React-Redux 恢复列表页跳转明细页之后返回列表状态
- hdu 5748 最长上升子序列
- Intel® Math Kernel Library (Intel® MKL)
- HDU1269 迷宫城堡
- Using BLAS and LAPACK from C/C++
- POJ1318 Word Amalgamation
- 【转】python操作mysql数据库
- 性能分析系列——小命令保证大性能
- JavaScript中的触发事件
- Linux与云计算——第二阶段 第四章:DNS服务器架设2-正向反向解析的正向反向解析