异或找dp

vis[i][j] = vis[i - 1][j] ^ vis[i - 1][j + 1]

#include<bits/stdc++.h>
using namespace std;
int vis[1200][1200];
int main(){
	int n;
	scanf("%d",&n);
	n=pow(2,n);
	vis[1][n]=1;
	for(
    int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(i==1&&j==n){
				printf("1 ");
				continue;
			}
			printf("%d ",vis[i][j]=vis[i-1][j]^vis[i-1][j+1]);
		}
		printf("\n");
	}
	return 0;
}