Submission #345480


Source Code Expand

N = int(input())
a = list(map(int, input().split(' ')))
a.sort()
f = [False] * len(a)
c = 0
for i, n in enumerate(a):
    if f[i] == True:
        continue
    f[i] = True
    c += 1
    t = a[i]
    for j in range(i+1, len(a)):
        if a[j] // t == 2 and a[j] % t == 0:
            f[j] = True
            t = a[j]

print (c)

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User tokichie
Language Python (3.2.3)
Score 0
Code Size 347 Byte
Status WA
Exec Time 2037 ms
Memory 24060 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 0 / 20 0 / 30 0 / 50
Status
AC × 3
AC × 14
WA × 9
AC × 3
TLE × 10
AC × 14
WA × 9
TLE × 20
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 133 ms 8304 KB
subtask0_1.txt AC 128 ms 8304 KB
subtask0_2.txt AC 129 ms 8304 KB
subtask1_0.txt AC 1591 ms 8548 KB
subtask1_1.txt WA 1592 ms 8676 KB
subtask1_10.txt AC 1575 ms 8548 KB
subtask1_11.txt AC 1602 ms 8816 KB
subtask1_12.txt AC 1592 ms 8804 KB
subtask1_13.txt AC 1604 ms 8736 KB
subtask1_14.txt AC 1611 ms 8736 KB
subtask1_15.txt AC 1622 ms 8800 KB
subtask1_16.txt AC 1593 ms 8808 KB
subtask1_17.txt AC 1598 ms 8740 KB
subtask1_18.txt AC 1631 ms 8740 KB
subtask1_19.txt AC 1632 ms 8740 KB
subtask1_2.txt WA 1667 ms 8624 KB
subtask1_3.txt WA 1602 ms 8672 KB
subtask1_4.txt WA 1640 ms 8676 KB
subtask1_5.txt WA 1601 ms 8808 KB
subtask1_6.txt WA 1596 ms 8816 KB
subtask1_7.txt WA 1712 ms 8676 KB
subtask1_8.txt WA 1613 ms 8680 KB
subtask1_9.txt WA 1641 ms 8656 KB
subtask2_0.txt TLE 2034 ms 22748 KB
subtask2_1.txt TLE 2035 ms 23000 KB
subtask2_2.txt TLE 2035 ms 23004 KB
subtask2_3.txt TLE 2035 ms 22988 KB
subtask2_4.txt TLE 2035 ms 23128 KB
subtask2_5.txt TLE 2035 ms 23000 KB
subtask2_6.txt TLE 2036 ms 22996 KB
subtask2_7.txt TLE 2035 ms 23000 KB
subtask2_8.txt TLE 2036 ms 23004 KB
subtask2_9.txt TLE 2035 ms 22988 KB
subtask3_0.txt TLE 2035 ms 22744 KB
subtask3_1.txt TLE 2036 ms 24056 KB
subtask3_2.txt TLE 2034 ms 24056 KB
subtask3_3.txt TLE 2035 ms 24056 KB
subtask3_4.txt TLE 2036 ms 23972 KB
subtask3_5.txt TLE 2035 ms 24020 KB
subtask3_6.txt TLE 2037 ms 24056 KB
subtask3_7.txt TLE 2037 ms 24048 KB
subtask3_8.txt TLE 2035 ms 24056 KB
subtask3_9.txt TLE 2036 ms 24060 KB