Submission #1496618

Source Code Expand

p,k=[],1
for i in bin(int(input())+1)[3:]:
	p+=[k]
	k+=1
	if i=='1':
		p=[k]+p
		k+=1
p+=range(1,k)
print(len(p))
print(*p)

Submission Info

Submission Time
Task C - Tautonym Puzzle
User fts2001
Language PyPy3 (2.4.0)
Score 1000
Code Size 132 Byte
Status AC
Exec Time 172 ms
Memory 38384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 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 AC 162 ms 38384 KB
00_example_02.txt AC 160 ms 38256 KB
01.txt AC 161 ms 38256 KB
02.txt AC 159 ms 38256 KB
03.txt AC 159 ms 38256 KB
04.txt AC 162 ms 38256 KB
05.txt AC 160 ms 38256 KB
06.txt AC 160 ms 38256 KB
07.txt AC 160 ms 38256 KB
08.txt AC 160 ms 38256 KB
09.txt AC 159 ms 38256 KB
10.txt AC 161 ms 38256 KB
11.txt AC 162 ms 38256 KB
12.txt AC 160 ms 38256 KB
13.txt AC 160 ms 38256 KB
14.txt AC 159 ms 38256 KB
15.txt AC 160 ms 38256 KB
16.txt AC 164 ms 38256 KB
17.txt AC 160 ms 38256 KB
18.txt AC 171 ms 38256 KB
19.txt AC 168 ms 38256 KB
20.txt AC 172 ms 38256 KB
21.txt AC 166 ms 38256 KB
22.txt AC 160 ms 38256 KB
23.txt AC 160 ms 38256 KB
24.txt AC 161 ms 38256 KB
25.txt AC 160 ms 38256 KB
26.txt AC 160 ms 38256 KB
27.txt AC 164 ms 38256 KB
28.txt AC 161 ms 38256 KB
29.txt AC 161 ms 38256 KB
30.txt AC 162 ms 38256 KB