Sum of Factorials(阶乘和)

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".

输入描述:

https://www.nowcoder.com/practice/42cb1c7f7344466b8cb1710cb12d06b1?tpId=4

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Pearls of discrete mathematics Pearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematicsPearls of discrete mathematics Contents I Counting: Basic 1 1 Subsets of a Set 3 2 Pascal’s Triangle 5 3 Binomial Coefficient Identities 11 II Counting: Intermediate 19 4 Finding a Polynomial 21 5 The Upward-Extended Pascal’s Triangle 25 6 Recurrence Relations and Fibonacci Numbers 27 III Counting: Advanced 37 7 Generating Functions and Making Change 39 8 Integer Triangles 49 9 Rook Paths and Queen Paths 53 IV Discrete Probability 65 10 Probability Spaces and Distributions 67 11 Markov Chains 81 12 Random Tournaments 91 V Number Theory 95 13 Divisibility of Factorials and Binomial Coefficients 97 14 Covering Systems 103

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值