#P10595. [ICPC-Shanghai 2011] Xavier is Learning to Count

    ID: 10062 远端评测题 10000ms 512MiB 尝试: 0 已通过: 0 难度: 9 上传者: 标签>O2优化生成函数,GF快速傅里叶变换 FFT

[ICPC-Shanghai 2011] Xavier is Learning to Count

Description

集合 SS 内有 mm 个互异整数。请对于任意整数 ii 求出 SS 内满足大小为 pp 且元素和为 ii 的子集数量。

3
3 3
1 2 3
5 4
1 3 5 6 7
10 3
1 2 3 4 5 6 7 8 9 10
Case #1:
6: 1

Case #2:
15: 1
16: 1
17: 1
19: 1
21: 1

Case #3:
6: 1
7: 1
8: 2
9: 3
10: 4
11: 5
12: 7
13: 8
14: 9
15: 10
16: 10
17: 10
18: 10
19: 9
20: 8
21: 7
22: 5
23: 4
24: 3
25: 2
26: 1
27: 1