题目1038：Sum of Factorials

#include <iostream>#include <algorithm>#include <queue>#include <vector>#include <cstring>#include <stack>#include <string>#include <string.h>#include <stdio.h>#include <cmath>#include <map>#include <functional>#include <set>#include <limits.h>#include <math.h>#include <ctype.h>using namespace std;//1038int d[10];void init(){    d[0]=1;    for(int i=1;i<10;i++)        d[i]=i*d[i-1];}int main(){       int n;    init();    while(cin>>n)    {        for(int i=9;i>=0;i--)            if(n>=d[i])                n-=d[i];        if(n)   cout<<"NO"<<endl;        else    cout<<"YES"<<endl;    }    return 0;}/**************************************************************    Problem: 1038    User: cust123    Language: C++    Result: Accepted    Time:0 ms    Memory:1520 kb****************************************************************/