【FOJ 1106】Sum of Factorials
2015-04-09 14:31
302 查看
题目描述
Problem 1106 Sum of Factorials解题思路
判断一个数是否能写成 10以内的阶乘之和。可以考虑从10!一直往下减,最后能全减完,则输出YES,注意特判0。
(事先把10以内的阶乘打表存好)
参考代码
#include <stdio.h> int main() { int n,num[10] = {1,1,2,6,24,120,720,5040,40320,362880}; while (~scanf("%d",&n) && n >= 0){ if (!n){ printf("NO\n"); continue; } for (int i = 9;i >= 0;--i) if (n >= num[i]) n -= num[i]; printf("%s\n",(!n)?"YES":"NO"); } return 0; }
相关文章推荐
- Problem 1106 Sum of Factorials
- POJ 1775 FZU 1106 LightOJ 1189 Sum of Factorials
- Problem 1106 Sum of Factorials
- FZU 1106 Sum of Factorials
- FZU 1106 Sum of Factorials
- lightoj-1189-Sum of Factorials【思维】
- POJ 1775 Sum of Factorials 数论,基础题
- LOJ 1189 - Sum of Factorials(打表)
- 九度OJ 1038 Sum of factorials (模拟)
- zoj 2358||poj1775 Sum of Factorials(阶乘)
- poj 1775 Sum of Factorials
- poj 1775 -- Sum of Factorials ( 够坑 )
- LightOJ 1189 - Sum of Factorials(贪心+阶乘)
- 【light-oj】-1189 - Sum of Factorials(思维,数学)
- UVALive2953 POJ1775 ZOJ2358 Sum of Factorials【打表+暴力+水题】
- 九度OJ 1038 Sum of Factorials
- POJ 1775 Sum of Factorials
- ZOJ 2358 Sum of Factorials
- zoj 2358 Sum of Factorials
- 九度OJ题目1038:Sum of Factorials