Submission #1633666


Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll c[25];int v[25];
int main(){
	ll n;
	scanf("%lld",&n);
	ll k=1;int m=1;
	while((k<<1)-1<=n){
		k<<=1;
		m++;
	}
	n-=(k-1);
//	printf("%lld\n",n);
	int l=m/2;
	c[0]=1;
	for(int i=1;i<=l;i++)c[i]=c[i-1]*(m-i+1)/i;
	int num=0;
	while(n){
		while(n>=c[l])v[l]++,n-=c[l],num++;
		l--;
	}
	printf("%d\n",m+2*num);
	int id=1;
	for(int i=0;i<m;i++){
		if(i<=m/2)for(int j=0;j<v[i];j++)printf("%d ",++id);
		printf("1 ");
	}
	while(id>1)printf("%d ",id--);
	puts("");
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:18: 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 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