POJ 1775 Sum of Factorials DFS 贪心
来源:互联网 发布:python while循环终止 编辑:程序博客网 时间:2024/06/04 18:15
本题就是求一个数是否能写成几个数的阶乘的和的形式,可以当作背包问题,也可以用DFS来解,下面用的贪心
http://poj.org/problem?id=1775
Sum of Factorials
Time Limit: 1000MS Memory Limit: 30000K
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".
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.
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
- POJ 1775 Sum of Factorials DFS 贪心
- poj 1775 Sum of Factorials
- poj 1775 Sum of Factorials
- POJ 1775 Sum of Factorials
- zoj 2358 || poj 1775 Sum of Factorials
- poj 1775(Sum of Factorials)
- POJ 1775 Sum of Factorials 二分模板
- POJ 1775 Sum of Factorials (ZOJ 2358)
- poj 1775&&zoj 2358 Sum of Factorials
- poj 1775 && zoj 2358 Sum of Factorials
- POJ 1775 Sum of Factorials(数论)
- poj 1775 Sum of Factorials 枚举子集
- POJ 1775 Sum of Factorials 笔记
- LightOJ 1189 - Sum of Factorials(贪心)
- LightOJ 1189 - Sum of Factorials(贪心+阶乘)
- poj 1775 -- Sum of Factorials ( 够坑 )
- Poj.1775 Sum of Factorials【略坑】 2015/10/12
- POJ 1775 (ZOJ 2358) Sum of Factorials
- tmp.c
- 如何在 Visual Studio 中像编辑普通 HTML 文件一样地编辑 SPARK 文件
- 数据加密中的DES加密算法详解
- 昨天冬至的饺子还在我肚子里转悠
- 正则表达式匹配单双引号
- POJ 1775 Sum of Factorials DFS 贪心
- tmp.c
- tmp.c
- tmp.c
- Symbian证书扫盲贴
- stl std::find使用
- Socket send函数和recv函数详解以及利用select()函数来进行指定时间的阻塞【转】
- exp/imp 与 expdp/impdp 对比 及使用中的一些优化事项
- Lucene学习总结之一:全文检索的基本原理