题目1038:Sum of Factorials 九度
来源:互联网 发布:北京南天软件 编辑:程序博客网 时间:2024/06/15 02:50
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:930
解决:351
- 题目描述:
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 a phenomenal 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 on set 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 expressed by 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.
- 样例输入:
92
- 样例输出:
YESYES
- 来源:
- 2007年上海交通大学计算机研究生机试真题
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int factorial (int n){int sum=1;int i;for (i=2;i<=n;i++){sum=sum*i;}return sum;}int main(){int jiecheng[10];int i,n;jiecheng[0]=1;for (i=1;i<10;i++){jiecheng[i]=factorial(i);}while (scanf ("%d",&n)!=EOF){int sum=0;if (n==0) {printf("YES\n");continue;}for (i=9;i>=0;i--){if (n>=jiecheng[i]){n-=jiecheng[i];}}if (n==0) printf ("YES\n");elseprintf ("NO\n");}return 0;}
注意特殊情况0!=1;
- 题目1038:Sum of Factorials 九度
- 九度oj 题目1038:Sum of Factorials
- 九度OJ题目1038:Sum of Factorials
- 九度 oj 题目1038:Sum of Factorials
- 九度OJ 1038 Sum of Factorials
- 九度oj-1038-Sum of Factorials
- 九度[1038]-Sum of Factorials
- 题目1038:Sum of Factorials
- 题目1038:Sum of Factorials
- 题目1038:Sum of Factorials
- 题目1038:Sum of Factorials
- 题目1038:Sum of Factorials
- 九度OJ 1038 Sum of factorials (模拟)
- 贪心法_题目1038:Sum of Factorials
- 九度OJ 1038:Sum of Factorials(阶乘的和) (DP、递归)
- Sum of Factorials
- Sum of Factorials
- Sum of Factorials
- dos下,解决端口占用问题
- PHP漏洞全解(三)-客户端脚本植入
- 项目中用log4j记录日志到指定目录
- Oracle ClusterwarePRCT-1011 : Failed to run "oifcfg". Detailed error: null
- 数组和指针的使用
- 题目1038:Sum of Factorials 九度
- 使用C#调用存储过程,用函数合理组织代码,使程序更加的清晰(示例)
- IOS多线程编程系类
- 1.洗冷水澡
- Eddy's mistakes
- windows笔记-跨越进程边界共享内核对象【对象句柄的继承性】
- 题目1167:数组排序
- 如何调整gVim7.3的字体及配色
- 开机启动慢的原因分析