Submission #1203766


Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n;
int i,j,k,m,q[211],a[211];
bool cmp(int x,int y){
	return q[x]<q[y];
}
int main(){
	scanf("%lld",&n);n++;
	for (m=1;(1LL<<m)<=n;m++) q[m]=2*m;
	m--;n-=(1LL<<m);
	while (n){
		for (i=0;(1LL<<i)<=n;i++);
		i--;n-=(1LL<<i);q[++m]=2*i+1;
	}
	for (i=1;i<=m;i++) a[i]=i;
	sort(a+1,a+1+m,cmp);
	printf("%d\n",2*m);
	for (i=1;i<=m;i++) printf("%d ",a[i]);
	for (i=1;i<=m;i++) printf("%d ",i);
	puts("");
	return 0;
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User lsmll
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 537 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

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

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 1 ms 128 KB
00_example_02.txt AC 1 ms 128 KB
01.txt AC 1 ms 128 KB
02.txt AC 1 ms 128 KB
03.txt AC 1 ms 128 KB
04.txt AC 1 ms 128 KB
05.txt AC 1 ms 128 KB
06.txt AC 1 ms 128 KB
07.txt AC 1 ms 128 KB
08.txt AC 1 ms 128 KB
09.txt AC 1 ms 128 KB
10.txt AC 1 ms 128 KB
11.txt AC 1 ms 128 KB
12.txt AC 1 ms 128 KB
13.txt AC 1 ms 128 KB
14.txt AC 1 ms 128 KB
15.txt AC 1 ms 128 KB
16.txt AC 1 ms 128 KB
17.txt AC 1 ms 128 KB
18.txt AC 1 ms 128 KB
19.txt AC 1 ms 128 KB
20.txt AC 1 ms 128 KB
21.txt AC 1 ms 128 KB
22.txt AC 1 ms 128 KB
23.txt AC 1 ms 128 KB
24.txt AC 1 ms 128 KB
25.txt AC 1 ms 128 KB
26.txt AC 1 ms 128 KB
27.txt AC 1 ms 128 KB
28.txt AC 1 ms 128 KB
29.txt AC 1 ms 128 KB
30.txt AC 1 ms 128 KB