九度OJ 1038 Sum of factorials （模拟）

时间：2014-12-13 15:10:00 阅读：182 评论：0 收藏：0 [点我收藏+]

标签：九度oj 1038

题目1038：Sum of Factorials

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：1491

解决：635

题目描述：:     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 contributions 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 Foundation 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 whether or not the number can be expressed by the sum of some factorials.
Well, it is just a piece of case. For a given n, you will check if there are some xi, and let n equal to Σt (上标) i=1（下标） xi! (t≥1, xi≥0, xi = xj <==> i = j)
           t
    即 Σ xi! (t≥1, xi≥0, xi = xj <==> i = j)
        i=1
    If the answer is yes, say "YES"; otherwise, print out "NO".

输入：: You will get a non-negative integer n (n≤1,000,000) from input file.

输出：: For the n in the input file, you should print exactly one word ("YES" or "NO") in a single line. No extra spaces are allowed.

样例输入：

9
2

样例输出：

YES
YES

题意：如果给定数字n可以表示成factorial数列的和，如9 = 1! + 2! + 3! ，则输出YES，否则输出NO.

#include<stdio.h>
int n;
int factorial[10]={1,1,2,6,24,120,720,5040,40320,362880};
//由于factorial[n] 比 sum(factorial[0 to n]) 要大，所以直接减就是了。
int check(int n){
    if(n==0)
    {
        printf("NO\n");
    }
    for(int i=9;i>=0;--i)
        if(n>=factorial[i])n-=factorial[i];
    if(n==0)
        printf("YES\n");
    else
        printf("NO\n");
}
int main(int argc, char *argv[])
{
    freopen("1038.in","r",stdin);
    while(~scanf("%d",&n))
    {
        check(n);
    }
    return 0;
}

九度OJ 1038 Sum of factorials （模拟）

标签：九度oj 1038

原文地址：http://blog.csdn.net/wdkirchhoff/article/details/41910077

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行