| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #5146 | #1035. 命运 | Wrong Answer | 0 | 2580 ms | 20148 K | Python 3 / 544 B | t330034045 | 2024-02-25 16:08:55 |
import sys
from collections import defaultdict
sys.setrecursionlimit(100000)
n, q = map(int, input().split())
mod = 1000000007
dp = [defaultdict(int) for _ in range(n + 1)]
list1 = list(map(int, input().split()))
for i in range(n):
for j in range(i):
dp[i + 1][list1[i] - list1[j]] += dp[j][list1[i] - list1[j]] + 1
dp[i + 1][list1[i] + list1[j]] += dp[j][list1[i] + list1[j]] + 1
for _ in range(q):
num = int(input())
ans = sum(v for k, v in dp[n].items() if k % num == 0)
print(ans % mod)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>用户输出
12
16
12
70
12
19
12
30
12
15
16
16
17
16
15
12
12
12
12
12
12
26
15
129
29
22
15
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>用户输出
77558
24570
24412
24580
24403
24403
31026
31026
24580
25168
33752
49797
24403
124161
25725
776063
25093
24570
30420
24510
24403
<59 bytes omitted>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>