Poj.1775 Sum of Factorials【略坑】 2015/10/12
2015-10-12 12:15
274 查看
[align=center]Sum of Factorials[/align]
Description
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 Σ1<=i<=txi!. (t >=1 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 file. 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
Sample Output
Source
Asia Guangzhou 2003
同ZOJ2358
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 13191 | Accepted: 4371 |
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 Σ1<=i<=txi!. (t >=1 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 file. 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
Source
Asia Guangzhou 2003
同ZOJ2358
#include<iostream> #include<cstdio> using namespace std; int per[10]; void init(){ per[0] = 1; for( int i = 1 ; i < 10 ; ++i ){ per[i] = per[i-1] * i; } } int main(){ init(); int n; while( ~scanf("%d",&n) ){ if( n < 0 ) break; if( n == 0 ){ printf("NO\n"); continue; } for( int i = 9 ; i >= 0 ; --i ){ if( n >= per[i] ){ n -= per[i]; } } if( n == 0 ) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- iOS9适配必看指南
- iOS-Git使用详解
- 正则后台验证、抓包
- excel中如何筛选重复数据
- win10 amd intel 双显卡 难以干掉黑屏 禁止ulps不利
- Android计算器
- [leetcode]Pascal's Triangle II
- android 内部存储相关知识点: getfilestreampath getDir 子文件夹
- tar命令--解压缩
- 常见面试题目
- 黑马程序员——Java语言--面向对象(二)
- READ ME
- C++不同编译单元内定义的非局部静态对象的初始化顺序
- String StringBuilder StringBuffer的区别
- c语言实现猜数字游戏
- Java中静态代理和动态代理介绍
- 黑马程序员——Java基础--------StringBuffer
- 软件测试面试题汇总
- 使用百度地图出现Unable to execute dex: Multiple dex files define Lcom/baidu/a/a/a/a错误解决方法
- Java 7之基础 - 强引用、弱引用、软引用、虚引用