Note: This article is available in Chinese only. 本文暂无英文版本。
View original
http://acm.hdu.edu.cn/showproblem.php?pid=2189 题意：n个人可以分成若干组，每组人数都为素数，问有多少种分法。 思路：母函数。先预处理素数，记得多处理一点…
1/* ***********************************************
2Author :111qqz
3Created Time :2016年02月26日 星期五 16时24分17秒
4File Name :code/hdu/2189.cpp
5************************************************ */
6
7#include <cstdio>muhanshu
8#include <cstring>
9#include <iostream>
10#include <algorithm>
11#include <vector>
12#include <queue>
13#include <set>
14#include <map>
15#include <string>
16#include <cmath>
17#include <cstdlib>
18#include <ctime>
19#define fst first
20#define sec second
21#define lson l,m,rt<<1
22#define rson m+1,r,rt<<1|1
23#define ms(a,x) memset(a,x,sizeof(a))
24typedef long long LL;
25#define pi pair < int ,int >
26#define MP make_pair
27
28using namespace std;
29const double eps = 1E-8;
30const int dx4[4]={1,0,0,-1};
31const int dy4[4]={0,-1,1,0};
32const int inf = 0x3f3f3f3f;
33const int N=155;
34int pri[N];
35int a[N],tmp[N];
36int cnt;
37int n;
38
39bool judge ( int n)
40{
41 if (n<=3) return true;
42 for ( int i = 2 ; i*i <= n ; i++)
43 {
44 if (n%i==0) return false;
45 }
46
47 return true;
48}
49
50
51void pre()
52{
53 cnt = 0;
54 for ( int i = 2 ; i <= 200 ; i++)
55 {
56 if (judge(i))
57 pri[++cnt] = i;
58 }
59}
60int main()
61{
62 #ifndef ONLINE_JUDGE
63 freopen("code/in.txt","r",stdin);
64 #endif
65
66
67 int T;
68 pre();
69 scanf("%d",&T);
70 while (T--)
71 {
72 scanf("%d",&n);
73
74 ms(a,0);
75 for ( int i = 0 ; i <= n ; i+=2 )
76 {
77 a[i] = 1;
78 tmp[i] = 0;
79 }
80
81
82 for ( int i = 2 ; pri[i] <= n ; i++)
83 {
84 for ( int j = 0 ; j <= n ; j++)
85 {
86 for ( int k = 0 ; k + j <= n ; k +=pri[i])
87 {
88 tmp[j+k] +=a[j];
89 }
90 }
91 for ( int j = 0 ; j <= n ; j ++)
92 {
93 a[j] = tmp[j];
94 tmp[j] = 0;
95 }
96 }
97
98 printf("%d\n",a[n]);
99 }
100
101 #ifndef ONLINE_JUDGE
102 fclose(stdin);
103 #endif
104 return 0;
105}