Submission #1801516


Source Code Expand

#include <cstdio>
typedef long long ll;
const int N = 205;
ll n;
int a[55], len, cnt, length, lx[N], rx[N], nl, nr;
void solve(ll x) {
	while (x) a[++len] = x & 1, x >>= 1;
	nl = 0, rx[nr = 1] = 1, cnt = 1;
	for (int i = len - 1; i; --i) 
		if (a[i]) {
			lx[++nl] = ++cnt, rx[++nr] = cnt;
			rx[++nr] = ++cnt, rx[++nr] = cnt;
		}
		else lx[++nl] = ++cnt, rx[++nr] = cnt;
	
	printf("%d\n", nl + nr);
	for (int i = nl; i; --i) printf("%d ", lx[i]);
	for (int i = 1; i <= nr; ++i) printf("%d ", rx[i]);
}
int main() {
	scanf("%lld", &n);
	solve(n + 1);
}

Submission Info

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

Compile Error

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

Judge Result

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