[51nod p3395] n-bit gray code [bit operation]

$link$

analysis ：

$n$ Bit gray code at most $2^n$ individual
For a binary number $x$ if $x$ Of the $i$ Place and number $i+1$ Same bit Then the number of gray code $i+1$ Position as $0$ Otherwise $1$
Obviously This is XOR

CODE：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define reg register
using namespace std;
typedef long long ll;
int n,k;
int main(){
    
	scanf("%d",&k);
	n=1<<k;
	for(int i=0;i<n;i++)
	{
    
		for(int j=k;j>=1;j--)
			printf("%d",(i>>(j-1)&1)^(i>>j&1));
		printf("\n");
	}
	return 0;
}