九度oj 1038
2015-08-16 14:31
281 查看
题目描述:
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.
样例输入:
样例输出:
来源:
2007年上海交通大学计算机研究生机试真题
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.
样例输入:
9 2
样例输出:
YES YES
来源:
2007年上海交通大学计算机研究生机试真题
#include<iostream> #include<stdio.h> using namespace std; int Factorials[10]={1,1,2,6,24,120,720,5040,40320,362880}; int main() { int n,i; while(cin>>n) { for(i=9;i>=0;i--) { if( Factorials[i]<=n) { n-= Factorials[i]; } if(n==0) { break; } } if(n>0) { cout<<"NO"<<endl; } else cout<<"YES"<<endl; } }
相关文章推荐
- [leetcode][math] Add Digits
- 黑客专属记事本(编程记事本)
- hdu 5392 Infoplane in Tina Town (质因子分解求最小公倍数)
- android 控件中layout_width,layout_height与onMeasure(int widthMeasureSpec, int heightMeasureSpec)
- 黑马程序员——C语言笔记之if,if....else....,switch判断
- POJ 1001 Exponentiation 求高精度幂
- CodeForces-552A - Vanya and Table
- 关于time的使用
- 2015年面试准备(1)-----c/c++的区别
- 认识javascript范围和作用域链
- HDU_1847 Good Luck in CET-4 Everybody!(SG函数)
- 制作自己的第一个报表
- 编写高质量代码改善C#程序的157个建议——建议48:Dispose方法应允许被多次调用
- Tarena - Week01:猜字母
- 关于读取速度
- HDOJ-5391 Zball in Tina Town(数学)
- 为什么图片加载我首先Glide
- Java中的八种基本数据类型所占字节的求法
- 基于bind工具实现DNS子域授权、子域父域相互解析
- Spring依赖注入