ZOJ - 2358 Sum of Factorials
来源:互联网 发布:2心淘宝号一个月刷几单 编辑:程序博客网 时间:2024/06/04 23:28
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 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
Source
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int a[11];
int i,n;
a[0]=1;
for(i=1;i<11;i++)
a[i]=a[i-1]*i;
while(scanf("%d",&n)&&n>=0)
{
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");
}
return 0;
}
- zoj 2358 Sum of Factorials
- ZOJ 2358 Sum of Factorials
- ZOJ 2358 Sum of Factorials
- ZOJ - 2358 Sum of Factorials
- Sum of Factorials zoj
- zoj 2358 || poj 1775 Sum of Factorials
- zoj 2358||poj1775 Sum of Factorials(阶乘)
- POJ 1775 Sum of Factorials (ZOJ 2358)
- poj 1775&&zoj 2358 Sum of Factorials
- poj 1775 && zoj 2358 Sum of Factorials
- ZOJ.2358 Sum of Factorials【略坑】 2015/10/12
- POJ 1775 (ZOJ 2358) Sum of Factorials
- Sum of Factorials
- Sum of Factorials
- Sum of Factorials
- poj1775 - Sum of Factorials
- 1038.Sum of Factorials
- fjnu 1050 Sum of Factorials
- zoj1904
- (3) SQL 语句 - 数据库基本操作
- Linux C Socket编程原理及简单实例
- N!
- Wi-Fi智能插座拆解:如何实现远程开关
- ZOJ - 2358 Sum of Factorials
- 逆序数的几种求法
- 原码、反码、补码
- 智能插座远程控制系统
- mybatis缓存
- 欢迎使用CSDN-markdown编辑器
- 圆桌会议:
- [UVA10410]Tree Reconstruction[BFS、DFS序建树]
- x264命令行参数解释