2013年7月31日
Light Oj- 1189 - Sum of Factorials
摘要： 题目内容：given an integern, you have to find whether it can be expressed as summation of factorials. For givenn, you have to report a solution such thatn = x1! + x2! + ... + xn! (xi#include#includeusing namespace std;long long s[25]= {0};int t[25]={0};int source(){s[0]=1; long long mid=1,i=1; for... 阅读全文
posted @ 2013-07-31 21:46 Qioayang,Allan,Zheng 阅读(479) 评论(0) 推荐(0)