Submission #1630779
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <math.h>
#include <limits.h>
#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define ll long long
#define INF 100000000
#define MOD 1000000007
#define SIZE 100005
#define FOR(i,a,n) for(i=(a);i<(n);i++)
int comp(const void* a,const void* b){
return *(int*)a-*(int*)b;
}
int res[200];
int add[200];
int main(void)
{
ll n;
int m,size,s=0,i;
scanf("%lld",&n);
for(m=50;n<(1LL<<m)-1;m--);
//printf("%d\n",1<<m);
FOR(i,1,m+1) res[i-1]=i;
n-=(1LL<<m)-1;
size=m;
for(i=m-1;i>=0;i--){
if(n<(1LL<<i)) continue;
m++;
add[i]=m;
n-=(1LL<<i);
}
printf("%d\n",m*2);
FOR(i,0,size){
if(add[i]) printf("%d ",add[i]);
printf("%d ",res[i]);
}
FOR(i,0,m) printf("%d%c",i+1,i==m-1?'\n':' ');
return 0;
}
Submission Info
Submission Time
2017-09-27 17:35:03+0900
Task
C - Tautonym Puzzle
User
trainstation
Language
C (GCC 5.4.1)
Score
1000
Code Size
924 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:24:2: warning: ignoring return value of ‘scanf’, 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
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