Submission #1177295
Source Code Expand
n, x = map(int, input().split()) a = list(map(int, input().split())) x = bin(x)[::-1] ans = 0 for i in range(n): if x == "0b0": break elif x[i] == "1": ans += a[i] print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | vesagran |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 209 Byte |
Status | RE |
Exec Time | 18 ms |
Memory | 2940 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.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, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 18 ms | 2940 KB |
subtask0_sample02.txt | AC | 18 ms | 2940 KB |
subtask0_sample03.txt | AC | 18 ms | 2940 KB |
subtask1_01.txt | AC | 18 ms | 2940 KB |
subtask1_02.txt | AC | 18 ms | 2940 KB |
subtask1_03.txt | AC | 18 ms | 2940 KB |
subtask1_04.txt | AC | 17 ms | 2940 KB |
subtask1_05.txt | AC | 18 ms | 2940 KB |
subtask1_06.txt | AC | 18 ms | 2940 KB |
subtask1_07.txt | AC | 18 ms | 2936 KB |
subtask1_08.txt | AC | 17 ms | 2940 KB |
subtask1_09.txt | RE | 18 ms | 2936 KB |
subtask1_10.txt | AC | 17 ms | 2940 KB |
subtask1_11.txt | AC | 18 ms | 2940 KB |
subtask1_12.txt | AC | 18 ms | 2940 KB |
subtask1_13.txt | AC | 17 ms | 2940 KB |
subtask1_14.txt | AC | 18 ms | 2940 KB |
subtask1_15.txt | AC | 17 ms | 2940 KB |
subtask1_16.txt | RE | 18 ms | 2940 KB |
subtask1_17.txt | AC | 17 ms | 2940 KB |