Submission #7552527
Source Code Expand
# 2019/09/16 n=int(input()) a=sorted(list(map(int,input().split()))) cnt=0 res=set() for e in a: if e%2==0: while not e&1: e>>=1 res.add(e) print(len(res))
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | calei |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 199 Byte |
Status | AC |
Exec Time | 133 ms |
Memory | 16096 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 30 / 30 | 50 / 50 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask1 | subtask1_0.txt, subtask1_1.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, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask2 | subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.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, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 17 ms | 2940 KB |
subtask0_1.txt | AC | 17 ms | 2940 KB |
subtask0_2.txt | AC | 17 ms | 2940 KB |
subtask1_0.txt | AC | 18 ms | 3444 KB |
subtask1_1.txt | AC | 20 ms | 3444 KB |
subtask1_10.txt | AC | 18 ms | 3444 KB |
subtask1_11.txt | AC | 20 ms | 3572 KB |
subtask1_12.txt | AC | 20 ms | 3572 KB |
subtask1_13.txt | AC | 20 ms | 3572 KB |
subtask1_14.txt | AC | 19 ms | 3572 KB |
subtask1_15.txt | AC | 20 ms | 3572 KB |
subtask1_16.txt | AC | 19 ms | 3572 KB |
subtask1_17.txt | AC | 20 ms | 3572 KB |
subtask1_18.txt | AC | 20 ms | 3572 KB |
subtask1_19.txt | AC | 20 ms | 3572 KB |
subtask1_2.txt | AC | 19 ms | 3444 KB |
subtask1_3.txt | AC | 20 ms | 3444 KB |
subtask1_4.txt | AC | 19 ms | 3444 KB |
subtask1_5.txt | AC | 20 ms | 3444 KB |
subtask1_6.txt | AC | 20 ms | 3444 KB |
subtask1_7.txt | AC | 20 ms | 3444 KB |
subtask1_8.txt | AC | 19 ms | 3444 KB |
subtask1_9.txt | AC | 20 ms | 3444 KB |
subtask2_0.txt | AC | 64 ms | 14700 KB |
subtask2_1.txt | AC | 117 ms | 13608 KB |
subtask2_2.txt | AC | 116 ms | 14556 KB |
subtask2_3.txt | AC | 117 ms | 14556 KB |
subtask2_4.txt | AC | 116 ms | 14556 KB |
subtask2_5.txt | AC | 126 ms | 13604 KB |
subtask2_6.txt | AC | 117 ms | 13604 KB |
subtask2_7.txt | AC | 122 ms | 13604 KB |
subtask2_8.txt | AC | 116 ms | 13604 KB |
subtask2_9.txt | AC | 117 ms | 13604 KB |
subtask3_0.txt | AC | 61 ms | 14700 KB |
subtask3_1.txt | AC | 124 ms | 15968 KB |
subtask3_2.txt | AC | 125 ms | 15964 KB |
subtask3_3.txt | AC | 129 ms | 16008 KB |
subtask3_4.txt | AC | 123 ms | 16064 KB |
subtask3_5.txt | AC | 122 ms | 16088 KB |
subtask3_6.txt | AC | 133 ms | 15988 KB |
subtask3_7.txt | AC | 130 ms | 16048 KB |
subtask3_8.txt | AC | 123 ms | 15964 KB |
subtask3_9.txt | AC | 123 ms | 16096 KB |