Submission #1195811


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

int main()
{
	long long X;
	scanf("%lld", &X);

	vector<int> ans;
	ans.push_back(1);
	ans.push_back(1);
	int last = 2;

	vector<int> steps;

	while (X >= 2)
	{
		if (X % 2 == 0)
		{
			X = X - 1;
			steps.push_back(1);
		}
		else
		{
			X = (X - 1) / 2;
			steps.push_back(2);
		}
	}

	reverse(steps.begin(), steps.end());
	for (int t : steps)
	{
		if (t == 1)
		{
			ans.push_back(last);
			ans.push_back(last);
			++last;
		}
		else
		{
			ans.insert(ans.begin() + ans.size() / 2, last);
			ans.push_back(last);
			++last;
		}
	}

	printf("%zd\n", ans.size());
	for (int t : ans) printf("%d ", t);
	printf("\n");
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &X);
                   ^

Test Cases

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