Submission #3018174
Source Code Expand
n = int(input()) arr = map(int,raw_input().split()) dic = {} for i in arr: t = i while t%2 == 0: t /= 2 if t in dic : dic[t] += 1 else : dic[t] = 1 print len(dic)
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | daleksprinter |
Language | Python (2.7.6) |
Score | 100 |
Code Size | 196 Byte |
Status | AC |
Exec Time | 101 ms |
Memory | 16084 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 | 10 ms | 2568 KB |
subtask0_1.txt | AC | 10 ms | 2568 KB |
subtask0_2.txt | AC | 10 ms | 2568 KB |
subtask1_0.txt | AC | 12 ms | 3012 KB |
subtask1_1.txt | AC | 12 ms | 3000 KB |
subtask1_10.txt | AC | 12 ms | 3012 KB |
subtask1_11.txt | AC | 12 ms | 3000 KB |
subtask1_12.txt | AC | 13 ms | 3000 KB |
subtask1_13.txt | AC | 12 ms | 3000 KB |
subtask1_14.txt | AC | 12 ms | 3000 KB |
subtask1_15.txt | AC | 12 ms | 3000 KB |
subtask1_16.txt | AC | 12 ms | 3000 KB |
subtask1_17.txt | AC | 12 ms | 3000 KB |
subtask1_18.txt | AC | 12 ms | 3000 KB |
subtask1_19.txt | AC | 12 ms | 3000 KB |
subtask1_2.txt | AC | 13 ms | 3000 KB |
subtask1_3.txt | AC | 12 ms | 3000 KB |
subtask1_4.txt | AC | 12 ms | 3000 KB |
subtask1_5.txt | AC | 12 ms | 3000 KB |
subtask1_6.txt | AC | 12 ms | 3000 KB |
subtask1_7.txt | AC | 12 ms | 3000 KB |
subtask1_8.txt | AC | 12 ms | 3000 KB |
subtask1_9.txt | AC | 12 ms | 3000 KB |
subtask2_0.txt | AC | 78 ms | 16044 KB |
subtask2_1.txt | AC | 91 ms | 11240 KB |
subtask2_2.txt | AC | 98 ms | 11240 KB |
subtask2_3.txt | AC | 90 ms | 11240 KB |
subtask2_4.txt | AC | 97 ms | 11240 KB |
subtask2_5.txt | AC | 92 ms | 11240 KB |
subtask2_6.txt | AC | 92 ms | 11240 KB |
subtask2_7.txt | AC | 89 ms | 11240 KB |
subtask2_8.txt | AC | 91 ms | 11240 KB |
subtask2_9.txt | AC | 97 ms | 11240 KB |
subtask3_0.txt | AC | 72 ms | 16044 KB |
subtask3_1.txt | AC | 96 ms | 16084 KB |
subtask3_2.txt | AC | 93 ms | 16084 KB |
subtask3_3.txt | AC | 94 ms | 16084 KB |
subtask3_4.txt | AC | 95 ms | 16084 KB |
subtask3_5.txt | AC | 101 ms | 16084 KB |
subtask3_6.txt | AC | 99 ms | 16084 KB |
subtask3_7.txt | AC | 94 ms | 16084 KB |
subtask3_8.txt | AC | 94 ms | 16084 KB |
subtask3_9.txt | AC | 101 ms | 16084 KB |