九度OJ 1038:Sum of Factorials(阶乘的和) (DP、递归)
来源:互联网 发布:mac找不到steam文件夹 编辑:程序博客网 时间:2024/05/21 17:28
- 题目描述:
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年上海交通大学计算机研究生机试真题
思路:
题意是问给出的数是否能表示成不同阶乘的和。
由于给出的n范围较小,最大的阶乘肯定不会超过10,因此尝试从10!开始逐步到1!看是否属于n的分解式即可。
代码:
#include <stdio.h> int main(void){ int n, i; int fac[10]; while (scanf("%d", &n) != EOF) { if (n == 0) { printf("NO\n"); continue; } fac[0] = 1; for (i=1; i<10; i++) fac[i] = fac[i-1]*i; for (i=9; i>=0; i--) { if (n >= fac[i]) n -= fac[i]; if (n == 0) break; } if (i == -1) printf("NO\n"); else printf("YES\n"); } return 0;}/************************************************************** Problem: 1038 User: liangrx06 Language: C Result: Accepted Time:0 ms Memory:912 kb****************************************************************/
- 九度OJ 1038:Sum of Factorials(阶乘的和) (DP、递归)
- 九度OJ 1038 Sum of factorials (模拟)
- 九度OJ 1038 Sum of Factorials
- 九度oj-1038-Sum of Factorials
- light oj 1189 - Sum of Factorials (阶乘+贪心)
- 九度oj 题目1038:Sum of Factorials
- 九度OJ题目1038:Sum of Factorials
- 九度 oj 题目1038:Sum of Factorials
- Lightoj1189——Sum of Factorials(阶乘的和+贪心)
- 题目1038:Sum of Factorials 九度
- 九度[1038]-Sum of Factorials
- 【light-oj】-1189 - Sum of Factorials(思维,数学)
- LIGHT OJ 1189 - Sum of Factorials【贪心+递归】
- zoj 2358||poj1775 Sum of Factorials(阶乘)
- LightOJ 1189 - Sum of Factorials(贪心+阶乘)
- poj 1775(Sum of Factorials)
- POJ 1775 Sum of Factorials(数论)
- 【LightOJ】1189 - Sum of Factorials(思维)
- BestCoder Round #60 5505GT and numbers
- 求大神帮忙解决一下 我ajax 传输不到后台servlet里面
- 使用jenkins进行项目构建
- 数据库连接池DBPool分析(九):Theron库+gtest来测试
- 线性表---双向循环链表
- 九度OJ 1038:Sum of Factorials(阶乘的和) (DP、递归)
- jdbc事务
- 我的博客开篇
- /proc/cpuinfo中siblings 和 cpu cores的区别
- web上传以及细节
- Struts-国际化
- uva10739(String to Palindrome)
- 关于sizeof与#pragma pack导致结构体大小变化的问题
- vim的一些命令