九度OJ 1038 Sum of Factorials
2014-02-28 21:18
218 查看
题目描述: John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions to the foundations of mathematics, logic, quantum physics, meteorology, science, computers, and game theory. He was noted for aphenomenal memory and the speed with which he absorbed ideas and solved problems. In 1925 he received a B.S. diploma in chemical engineering from Zurich Institute and in 1926 a Ph.D. in mathematics from the University of Budapest, His Ph.D. dissertation onset theory was an important contributions to the subject. At the age of 20, von Neumann proposed a new definition of ordinal numbers that was universally adopted. While still in his twenties, he made many contributions in both pure and applied mathematics that established him as a mathematician of unusual depth.His Mathematical Foundation of Quantum Mechanics (1932) built a solid framework for the new scientific discipline. During this time he also proved the mini-max theorem of GAME THEORY. He gradually expanded his work in game theory, and with coauthor Oskar Morgenstern he wrote Theory of Games and Economic Behavior (1944). There are some numbers which can be expressed by the sum of factorials. For example 9, 9 = 1! + 2! + 3! . Dr. von Neumann was very interested in such numbers. So, he gives you a number n, and wants you to tell whether or not the number can be expressedby the sum of some factorials.Well, it is just a piece of case. For a given n, you will check if there are some xi, and let n equal to Σt (上标) i=1(下标) xi! (t≥1, xi≥0, xi = xj <==> i = j) t 即 Σ xi! (t≥1, xi≥0, xi = xj <==> i = j) i=1 If the answer is yes, say "YES"; otherwise, print out "NO".输入: You will get a non-negative integer n (n≤1,000,000) from input file.输出: For the n in the input file, you should print exactly one word ("YES" or "NO") in a single line. No extra spaces are allowed.样例输入:
9 2样例输出:
YES YES
水题一道,题目还这么长。。。。。。
#include <stdio.h>int main(){int n;while(scanf("%d",&n) != EOF){int buf[10];buf[0] = 1;for(int i = 1; i < 10; i++)buf[i] = i * buf[i-1];for(int j = 9; j >= 0; j--){if(n >= buf[j])n -= buf[j];}if(n == 0)printf("YES\n");elseprintf("NO\n");}return 0;}
相关文章推荐
- UBOOT移植OK210开发板
- POJ 2761 Feed the dogs
- mysql列属性auto(mysql笔记四)
- 创客文章
- POJ_3044_City Skyline(栈)
- 在AWS上安装laravel框架
- AppleScript学习笔记(三)捕捉错误
- usaco 1.23
- 使用CMD建立指定格式的文件
- error 2005:libcmtd.lib和msvcrt.lib冲突
- PageRank算法细讲
- 如何删除数据表中重复数据(二)
- 训练局限玻尔斯曼机(Training Restricted Boltzmann Machines)
- Android 下载文件至SD卡,并用progressBar显示下载进度
- 在命令提示符窗口下(cmd)使用指令操作并编译java代码,运行java编译代码
- 数据通信与网络五——电话网和电视网进行数据传输
- RDO、SAD、SATD、λ(转贴) - [h.264]
- mac os 安装tomcat完全教程
- UML实战之Use Case Diagrams
- 排序算法之归并排序