Submission #1610200


Source Code Expand

#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
ll two[50+5],s;
int a[210],b[50+5],c[210];
int i,j,k,l,t,n,m,mx,tot,top,now;
int main(){
	//freopen("data.out","w",stdout);
	scanf("%lld",&s);
	two[0]=1;
	fo(i,1,50) two[i]=(ll)two[i-1]*2;
	mx=50;
	while (two[mx]>s) mx--;
	s-=two[mx];
	m=mx;
	tot=2*m;
	now=m;
	c[++top]=now+1;
	c[++top]=now+1;
	now++;
	tot+=2;
	while (s){
		while (two[mx]>s) mx--;
		s-=two[mx];
		b[mx]=++now;
		c[++top]=now;
		tot+=2;
	}
	printf("%d\n",tot);
	fo(i,0,m){
		if (i) printf("%d ",i);
		if (b[i]) printf("%d ",b[i]);
	}
	fo(i,1,m) printf("%d ",i);
	fo(i,1,top) printf("%d ",c[i]);
}

Submission Info

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

Compile Error

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

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 0 ms 128 KB
00_example_02.txt AC 0 ms 128 KB
01.txt AC 1 ms 128 KB
02.txt AC 0 ms 128 KB
03.txt AC 0 ms 128 KB
04.txt AC 1 ms 128 KB
05.txt AC 0 ms 128 KB
06.txt AC 1 ms 128 KB
07.txt AC 0 ms 128 KB
08.txt AC 0 ms 128 KB
09.txt AC 0 ms 128 KB
10.txt AC 0 ms 128 KB
11.txt AC 0 ms 128 KB
12.txt AC 0 ms 128 KB
13.txt AC 0 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 0 ms 128 KB
18.txt AC 1 ms 128 KB
19.txt AC 0 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 0 ms 128 KB
25.txt AC 0 ms 128 KB
26.txt AC 1 ms 128 KB
27.txt AC 0 ms 128 KB
28.txt AC 0 ms 128 KB
29.txt AC 1 ms 128 KB
30.txt AC 1 ms 128 KB