早教吧作业答案频道 -->英语-->
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...的网友还看了以下:
一道java编程题:有一矩阵:a b c d e f g h i j k l m n o p q 2020-04-06 …
在正方形ABCD-A1B1C1D1中,M,N,O分别为BB1,BC,B1D1的中点 求异面直线OB 2020-05-16 …
在一个关系模式R(M, N, O, P)中,若各个属性间没有任何函数依赖关系,则该模式的主属性有() 2020-05-24 …
汽车分类的问题,汽车分类的M1,M2,B1,B2,H、N1、N2等分别代表什么车?最近在做一个3吨 2020-06-09 …
矩阵相乘(重发1)|a,b|Y=|c,d|,Z=|g,h,i|,求YZ.|e,f||j,k,l|| 2020-06-10 …
不等式,比较盐水中有n克盐(m>n>o),再添a克(a>o)盐后,盐水明显变咸了,根据这一事实,提 2020-06-18 …
一个n脚输入的或门是否能被n-1个二脚输入的或门替代,为什么?顺便问个布尔代数化简M.R.P+Q. 2020-06-20 …
下列加点字的注音全都正确的一项是()A.蹊跷(qīqiǎo)嫣红(yān)玛瑙(mǎnǎo)祈祷( 2020-06-21 …
已知圆Ax^2+y^2=1圆B与圆A外切于(3/5,4/5),半径为4求B的方程直线x+y+m=o 2020-07-24 …
为什么"anew".不用an,n是元音那A,E,F,H,I,L,M,N,O,R,S,X用an,中有呀 2021-01-08 …