Submission #6393492
Source Code Expand
two = [2] while two[-1] <= 10 ** 9: two.append(two[-1] * 2) N = int(input()) A = list(map(int, input().split())) ret = 0 for i, a in enumerate(A): for t in two[::-1]: if a % t == 0: A[i] = a // t break print(len(set(A)))
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | wat_shun |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 283 Byte |
Status | AC |
Exec Time | 478 ms |
Memory | 14972 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 | 3060 KB |
subtask0_1.txt | AC | 17 ms | 2940 KB |
subtask0_2.txt | AC | 17 ms | 3060 KB |
subtask1_0.txt | AC | 26 ms | 3444 KB |
subtask1_1.txt | AC | 28 ms | 3444 KB |
subtask1_10.txt | AC | 27 ms | 3444 KB |
subtask1_11.txt | AC | 28 ms | 3444 KB |
subtask1_12.txt | AC | 28 ms | 3444 KB |
subtask1_13.txt | AC | 28 ms | 3444 KB |
subtask1_14.txt | AC | 29 ms | 3444 KB |
subtask1_15.txt | AC | 28 ms | 3444 KB |
subtask1_16.txt | AC | 29 ms | 3444 KB |
subtask1_17.txt | AC | 28 ms | 3444 KB |
subtask1_18.txt | AC | 29 ms | 3444 KB |
subtask1_19.txt | AC | 28 ms | 3444 KB |
subtask1_2.txt | AC | 27 ms | 3444 KB |
subtask1_3.txt | AC | 27 ms | 3444 KB |
subtask1_4.txt | AC | 27 ms | 3444 KB |
subtask1_5.txt | AC | 27 ms | 3444 KB |
subtask1_6.txt | AC | 27 ms | 3444 KB |
subtask1_7.txt | AC | 27 ms | 3444 KB |
subtask1_8.txt | AC | 28 ms | 3444 KB |
subtask1_9.txt | AC | 28 ms | 3444 KB |
subtask2_0.txt | AC | 332 ms | 14596 KB |
subtask2_1.txt | AC | 349 ms | 14684 KB |
subtask2_2.txt | AC | 340 ms | 13604 KB |
subtask2_3.txt | AC | 354 ms | 13604 KB |
subtask2_4.txt | AC | 351 ms | 14684 KB |
subtask2_5.txt | AC | 375 ms | 13604 KB |
subtask2_6.txt | AC | 348 ms | 13604 KB |
subtask2_7.txt | AC | 362 ms | 14556 KB |
subtask2_8.txt | AC | 345 ms | 13604 KB |
subtask2_9.txt | AC | 366 ms | 13608 KB |
subtask3_0.txt | AC | 328 ms | 14972 KB |
subtask3_1.txt | AC | 406 ms | 14364 KB |
subtask3_2.txt | AC | 478 ms | 14360 KB |
subtask3_3.txt | AC | 385 ms | 14360 KB |
subtask3_4.txt | AC | 385 ms | 14360 KB |
subtask3_5.txt | AC | 433 ms | 14364 KB |
subtask3_6.txt | AC | 391 ms | 14360 KB |
subtask3_7.txt | AC | 385 ms | 14356 KB |
subtask3_8.txt | AC | 389 ms | 14360 KB |
subtask3_9.txt | AC | 406 ms | 14360 KB |