HDU 2212 DFS
2016-07-04 21:59
363 查看
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 ......
Author
zjt#include<stdio.h> int main() { printf("1\n2\n145\n40585\n"); return 0; }
敲代码算出来(时间有点长....发现只有四个答案就)
相关文章推荐
- c# serialport读取不限数量的16进制数据
- PAT (Advanced Level) 1096. Consecutive Factors (20)
- 使用不带圆括号的函数名是访问函数指针,而不是调用函数名
- java学习中的部分注解
- deque 迭代器失效的问题详解
- jQuery源码解读系列之代码结构分析
- The current branch is not configured for pull No value for key branch.master.merge found in configur
- 安卓中存储空间
- [数据生成器] 无根树
- C语言中 #include的作用
- Entities and Entities's Relation Extraction of ACE 2005
- 线程死锁
- Eclipse编译C,C++,JAVA程序
- Windows2008系统中IIS的安装配置图文教程
- 一键让Linux的vim显示行号
- 【递归与递推】电话号码
- [20160704]Addition program that use JOptionPane for input and output
- FJ省队集训DAY2 T2
- PAT (Advanced Level) 1095. Cars on Campus (30)
- jQuery的document ready与 onload事件——你真的思考过吗?