Submission #1801643


Source Code Expand

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
long long n;
int m, i, j, k, l, r, z, a[405], len;
int po[80];
int main()
{
	cin >> n;
	if (n == 1) {cout << "1 1"; return 0;}
	n ++;
	l = 200; r = 199;
	while (n != 1)
	{
		++len;
		if (n & 1) po[len] = 1;
		n >>= 1;
	}
	//cout << len << endl;
	for(i = len; i >= 1; i --)
	{
		a[++r] = ++z;
		if (po[i]) a[--l] = ++z;
	}
	cout << (r - l + 1) * 2 << endl;
	for(i = l; i <= r; i ++)
		cout << a[i] << " ";
	for(i = 1; i <= r - l + 1; i ++)
		cout << i << " ";
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User diaosipan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 603 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 31
WA × 1
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 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt WA 1 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB