[51nod] 3395 n-bit gray code

n Bit code

Link

---

Their thinking

If a digit is equal to the previous digit , Then this one is $1$ , It is $0$ , Can be done with or .

code

#include<iostream>
#include<cstdio>
#define int long long
using namespace std;

int n;

void output(int x)
{
    
	int a[20],tot=0;
	while(x) a[++tot]=x%2,x>>=1;
	for(int i=n;i>tot;i--) printf("0");
	while(tot) printf("%lld",a[tot--]);
	printf("\n");	
}

signed main()
{
    
	cin>>n;
	for(int i=0;i<(1<<n);i++)
		output(i^(i>>1));
}