思路有点像第三篇题解：

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 1500;
int a[MAXN][MAXN], ans[MAXN][MAXN];

signed main() {
	a[1][1] = 1;
	int n, m;
	cin >> n;
	m = pow(2, n);

	for (int i = 1; i <= m; i++) {

		for (int j = 1; j <= i; j++) {

			if (i == 1 and j == 1)
				continue;
			a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
			ans[i][j] = a[i][j] % 2;
		}
	}

	ans[1][1] = 1;

	for (int i = 1; i <= m; i++) {

		for (int j = m; j >= 1; j--) {

			cout << ans[i][j] << ' ';
		}

		cout << '\n';
	}



	return 0;
}

救救孩子！