Submission #3389609
Source Code Expand
n,a = map(int, input().split()) list_x = list(map(int, input().split())) dp = [ [[0] * 100 for i in range(100)] for j in range(100)] for j in range(n+1): for k in range(n+1): for s in range(sum(list_x) + 1): if j == 0 and k == 0 and s == 0: dp[j][k][s] = 1 elif j >= 1 and s < list_x[j - 1]: dp[j][k][s] = dp[j - 1][k][s] elif j >= 1 and k >= 1 and s >= list_x[j - 1]: dp[j][k][s] = dp[j - 1][k - 1][s - list_x[j-1]] + dp[j - 1][k][s] else: dp[j][k][s] = 0 ans = 0 for p in range(1,n+1): ans += dp[n][p][p*a] print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | KFCHY |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 568 Byte |
Status | RE |
Exec Time | 154 ms |
Memory | 11636 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 100 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt, example_03.txt, example_04.txt |
Subtask1 | example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
All | example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 42 ms | 11636 KB |
example_02.txt | AC | 41 ms | 11636 KB |
example_03.txt | AC | 44 ms | 11636 KB |
example_04.txt | AC | 142 ms | 11636 KB |
subtask1_01.txt | RE | 42 ms | 11636 KB |
subtask1_02.txt | RE | 42 ms | 11636 KB |
subtask1_03.txt | RE | 41 ms | 11636 KB |
subtask1_04.txt | RE | 47 ms | 11636 KB |
subtask1_05.txt | RE | 42 ms | 11636 KB |
subtask1_06.txt | AC | 44 ms | 11636 KB |
subtask1_07.txt | AC | 42 ms | 11636 KB |
subtask1_08.txt | RE | 42 ms | 11636 KB |
subtask1_09.txt | RE | 43 ms | 11636 KB |
subtask2_01.txt | RE | 43 ms | 11636 KB |
subtask2_02.txt | RE | 42 ms | 11636 KB |
subtask2_03.txt | RE | 42 ms | 11636 KB |
subtask2_04.txt | RE | 43 ms | 11636 KB |
subtask2_05.txt | RE | 42 ms | 11636 KB |
subtask2_06.txt | RE | 154 ms | 11636 KB |
subtask2_07.txt | RE | 41 ms | 11636 KB |
subtask2_08.txt | RE | 41 ms | 11636 KB |
subtask2_09.txt | RE | 43 ms | 11636 KB |
subtask2_10.txt | RE | 43 ms | 11636 KB |
subtask2_11.txt | RE | 42 ms | 11636 KB |