Submission #2741895
Source Code Expand
n,a = map(int,raw_input().split()) arr = map(int,raw_input().split()) arry = [] for i in range(n): arry.append(arr[i]-a) dp = [[0 for i in range((n)*50*2)] for j in range(n+1)] dp[0][n*50] = 1 for i in range(n): for j in range(n*50*2): if 0 <= j-arry[i] and j-arry[i] < n*50*2 : dp[i+1][j] = dp[i][j]+dp[i][j-arry[i]] else : dp[i+1][j] = dp[i][j] print dp[n][n*50]-1
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | daleksprinter |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 403 Byte |
Status | AC |
Exec Time | 145 ms |
Memory | 5380 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 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 | 12 ms | 2696 KB |
example_02.txt | AC | 11 ms | 2696 KB |
example_03.txt | AC | 14 ms | 2696 KB |
example_04.txt | AC | 69 ms | 3588 KB |
subtask1_01.txt | AC | 24 ms | 2948 KB |
subtask1_02.txt | AC | 24 ms | 2820 KB |
subtask1_03.txt | AC | 24 ms | 2820 KB |
subtask1_04.txt | AC | 24 ms | 2820 KB |
subtask1_05.txt | AC | 24 ms | 2820 KB |
subtask1_06.txt | AC | 10 ms | 2696 KB |
subtask1_07.txt | AC | 10 ms | 2696 KB |
subtask1_08.txt | AC | 24 ms | 2820 KB |
subtask1_09.txt | AC | 23 ms | 2820 KB |
subtask2_01.txt | AC | 145 ms | 5252 KB |
subtask2_02.txt | AC | 145 ms | 5380 KB |
subtask2_03.txt | AC | 140 ms | 5124 KB |
subtask2_04.txt | AC | 144 ms | 4868 KB |
subtask2_05.txt | AC | 144 ms | 4996 KB |
subtask2_06.txt | AC | 144 ms | 4996 KB |
subtask2_07.txt | AC | 145 ms | 5124 KB |
subtask2_08.txt | AC | 69 ms | 3844 KB |
subtask2_09.txt | AC | 70 ms | 3716 KB |
subtask2_10.txt | AC | 101 ms | 4484 KB |
subtask2_11.txt | AC | 110 ms | 4612 KB |