Submission #1476783


Source Code Expand

#!/usr/bin/env python3
n = int(input())
x = []
y = []
k = 1
for c in bin(n)[2 :][1 :]:
    x += [ k ]
    y += [ k ]
    k += 1
    if int(c):
        x = [ k ] + x
        y += [ k ]
        k += 1
if not (x + y):
    x = [ 100 ]
print(len(x + y))
print(*(x + y))

Submission Info

Submission Time
Task C - Tautonym Puzzle
User kimiyuki
Language Python (3.4.3)
Score 0
Code Size 282 Byte
Status WA
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
WA × 2
WA × 32
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt
Case Name Status Exec Time Memory
00_example_01.txt WA 16 ms 3060 KB
00_example_02.txt WA 17 ms 3060 KB
01.txt WA 17 ms 3060 KB
02.txt WA 17 ms 3060 KB
03.txt WA 16 ms 3060 KB
04.txt WA 17 ms 3060 KB
05.txt WA 16 ms 2940 KB
06.txt WA 17 ms 2940 KB
07.txt WA 16 ms 3060 KB
08.txt WA 16 ms 3060 KB
09.txt WA 17 ms 3064 KB
10.txt WA 16 ms 3060 KB
11.txt WA 17 ms 3060 KB
12.txt WA 17 ms 3064 KB
13.txt WA 17 ms 3060 KB
14.txt WA 17 ms 3060 KB
15.txt WA 17 ms 3060 KB
16.txt WA 16 ms 2940 KB
17.txt WA 16 ms 3060 KB
18.txt WA 16 ms 3060 KB
19.txt WA 16 ms 3060 KB
20.txt WA 17 ms 3060 KB
21.txt WA 17 ms 3060 KB
22.txt WA 17 ms 3060 KB
23.txt WA 17 ms 3060 KB
24.txt WA 17 ms 3060 KB
25.txt WA 17 ms 3060 KB
26.txt WA 16 ms 3060 KB
27.txt WA 16 ms 3064 KB
28.txt WA 16 ms 2940 KB
29.txt WA 17 ms 3060 KB
30.txt WA 17 ms 3060 KB