南阳OJ-91-阶乘之和---二进制枚举（入门）

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #include<set>
 6 #include<cmath>
 7 using namespace std;
 8 const int maxn = 1e4 + 10;
 9 int T, n;
10 int a[20];
11 set<int>s;
12 void judge(int x)
13 {
14     int tot = 0;
15     for(int i = 0; i < 9; i++)
16     {
17         if(x&(1<<i))tot += a[i + 1];
18     }
19     s.insert(tot);
20 }
21 int main()
22 {
23     cin >> T;
24     a[1] = 1;
25     for(int i = 2; i <= 9; i++)a[i] = a[i - 1] * i;
26     for(int i = 1; i < (1<<9); i++)
27     {
28         judge(i);
29     }
30     while(T--)
31     {
32         cin >> n;
33         if(s.count(n))cout<<"Yes"<<endl;
34         else cout<<"No"<<endl;
35     }
36     return 0;
37 }