[Poetize II]太鼓达人

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 100000
26 
27 #define maxm 500+100
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 #define mod 1000000007
44 
45 using namespace std;
46 
47 inline int read()
48 
49 {
50 
51     int x=0,f=1;char ch=getchar();
52 
53     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
54 
55     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
56 
57     return x*f;
58 
59 }
60 int n,m,a[maxn];
61 bool b[maxn];
62 inline bool dfs(int sum,int t)
63 {
64     a[sum]=t;
65     if(sum==m)
66     {
67         //for0(i,m-1)if(!b[i])return 0;
68         for1(i,m)printf("%d",a[i]>>n-1);printf("\n");
69         return 1;
70     }
71     int k=(t<<1)&((1<<n)-1);
72     for0(i,1)if(!b[k+i])
73     {
74         b[k+i]=1;
75         if(dfs(sum+1,k+i))return 1;
76         b[k+i]=0;
77     }
78     return 0;
79 }
80 
81 int main()
82 
83 {
84 
85     freopen("input.txt","r",stdin);
86 
87     freopen("output.txt","w",stdout);
88 
89     n=read();m=1<<n;
90     printf("%d ",m);
91     dfs(0,0);
92 
93     return 0;
94 
95 }