| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #5150 | #1035. 命运 | Wrong Answer | 0 | 2582 ms | 10800 K | Python 3 / 693 B | t330034045 | 2024-02-25 16:10:14 |
import sys
from collections import defaultdict
sys.setrecursionlimit(100000)
n, q = map(int, input().split())
mod = 1000000007
list1 = list(map(int, input().split()))
# 初始化dp数组
dp = [defaultdict(int) for _ in range(n + 1)]
dp[0][0] = 1
# 更新dp数组
for i in range(n):
for j in range(i + 1):
dp[j + 1][list1[i]] += dp[j][list1[i]]
dp[j + 1][-list1[i]] += dp[j][-list1[i]]
dp[j + 1][list1[i]] %= mod
dp[j + 1][-list1[i]] %= mod
# 处理询问
for _ in range(q):
num = int(input())
ans = 0
for k, v in dp[n].items():
if k % num == 0:
ans += v
ans %= mod
print(ans)95 27
-997539194 -997539223 -997539203 -997539196 -997539200 -997539204 -997539191 -997539210 -99753
<1032 bytes omitted>805781535
713571652
560531218
417146333
300038627
255849128
688375560
567828174
116009787
791230879
<167 bytes omitted>用户输出
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0575 30
624834518 624834524 624834518 624834508 624834500 624834502 624834498 624834489 624834514 624
<5746 bytes omitted>155226838
328268214
899171208
331459190
455255862
95748906
210916867
210916867
331459190
890349468
8
<198 bytes omitted>用户输出
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 09529 27
976772767 976772748 976772782 976772766 976772770 976772783 976772751 976772785 976772757 97
<95278 bytes omitted>