ZOJ 2358 —— 水题
来源:互联网 发布:python 字典 添加元素 编辑:程序博客网 时间:2024/05/17 20:21
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
没有什么难度,最主要的是要注意0!=1的概念,所以4也是满足的。代码如下
void zoj_2358(){long n,i,j;long a[11];a[0]=1;for(i=1;i<11;i++)a[i]=a[i-1]*i;while(scanf("%ld",&n)!=EOF){if(n<0) break;if(n==0){printf("NO\n"); continue;}for(i=10;i>=0&&n>0;i--)if(n>=a[i])n-=a[i];if(n==0) printf("YES\n");else printf("NO\n");}}
- ZOJ 2358 —— 水题
- zoj 2358 水题.
- ZOJ——5013
- zoj july— 小记
- ZOJ—2610
- ZOJ Monthly, December 2011——zoj 3568
- 第二次选拔——ZOJ
- ZOJ 3728——Collision
- 2224Investment——zoj
- zoj 3612 ——Median
- zoj 3859——Candies
- Zoj 2947——Abbreviation
- ZOJ 3630 —— Information
- ZOJ 3932——Handshakes
- ZOJ - 3537 —— Cake
- ZOJ-2358
- ZOJ 3622 —— Magic Number(水题)
- ZOJ——1649(宽度搜索)
- iptables 端口映射的一点经验
- Android系统架构解析
- linux+php5.1.6+mysql5.0.2+apache2.0.55安装配置说明:
- Eclipse选中变量名,相同变量都变色显示 的设置
- webservice 服务器代码获取客户端的IP地址
- ZOJ 2358 —— 水题
- struts配置错误页面
- cxGrid使用点滴
- Java编译器使用入门
- 获取系统时间
- Apk文件破解可见源码
- Excel数据填充技巧
- Oracle——distinct的用法
- js实现页面跳转的几种方式