早教吧作业答案频道 -->英语-->
acm题为什么wronganswer啊JohnvonNeumann,b.Dec.28,1903,d.Feb.8,1957,wasaHungarian-Americanmathematicianwhomadeimportantcontributionstothefoundationsofmathematics,logic,quantumphysics,meteorology,science,computers,and
题目详情
acm题为什么wrong answer啊
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 contribution 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 Foundations 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 him whether or not the number can be expressed by the sum of some factorials.
Well, it's just a piece of cake. For a given n, you'll check if there are some xi, and let n equal to SUM{xi!} (1 ≤ i ≤ t, t ≥ 1, xi ≥ 0, xi = xj iff. i = j). If the answer is yes, say "YES"; otherwise, print out "NO".
Input
You will get several non-negative integer n (n ≤ 1,000,000) from input. Each one is in a line by itself.
The input is terminated by a line with a negative integer.
Output
For each n, you should print exactly one word ("YES" or "NO") in a single line. No extra spaces are allowed.
Sample Input
9
-1
Sample Output
YES
#include
using namespace std;
int main()
{
int m,n,a[9]={1,2,6,24,120,720,5040,40320,362880},b=0,c=0,d=0,e=0,f=0;
while(n>=0&&cin>>n)
{
for(m=0;m
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 contribution 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 Foundations 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 him whether or not the number can be expressed by the sum of some factorials.
Well, it's just a piece of cake. For a given n, you'll check if there are some xi, and let n equal to SUM{xi!} (1 ≤ i ≤ t, t ≥ 1, xi ≥ 0, xi = xj iff. i = j). If the answer is yes, say "YES"; otherwise, print out "NO".
Input
You will get several non-negative integer n (n ≤ 1,000,000) from input. Each one is in a line by itself.
The input is terminated by a line with a negative integer.
Output
For each n, you should print exactly one word ("YES" or "NO") in a single line. No extra spaces are allowed.
Sample Input
9
-1
Sample Output
YES
#include
using namespace std;
int main()
{
int m,n,a[9]={1,2,6,24,120,720,5040,40320,362880},b=0,c=0,d=0,e=0,f=0;
while(n>=0&&cin>>n)
{
for(m=0;m
▼优质解答
答案和解析
7=1!+3!
这个数据你就不对
这个数据你就不对
看了 acm题为什么wrongan...的网友还看了以下:
1903年英语怎么说?1903的读法 2020-03-30 …
"1903"用英语怎么说1903年,口语 2020-03-31 …
Unit1 的 A(3a-4)11.People will live to be 150 year 2020-05-17 …
All computers need some sort of(71)(OS). Tile majo 2020-05-26 …
1903用英文怎么读,快啊,急是1903年 2020-06-19 …
acm题为什么wronganswer啊JohnvonNeumann,b.Dec.28,1903,d 2020-06-20 …
1903年《奏定学堂章程1903年《奏定学堂章程》颁布,其意义不包括A.打破儒家经典一统天下的局面 2020-07-11 …
December17th,1903怎么读?December17th,1903读起来是以一个什么顺序 2020-08-04 …
阅读下面文字,完成后面题目。1895年,被称为第七艺术的电影dàn生了。1903年,电视悄然问世。人 2020-12-22 …
阅读下面文字,完成后面题目。(5分)1895年,被称为第七艺术的电影dàn生了。1903年,电视悄然 2020-12-22 …