要答案吗？看这里！

#include <bits/stdc++.h>
using namespace std;
int n,m,a[70][70],h=1;
int main()
{
  scanf("%d",&m);
  n=1<<m;
  a[1][1]=1;
  for(int i=1; i<=m; i=i+1)
  {
    for(int j=1; j<=h; j=j+1)
    {
      for(int k=1; k<=h; k=k+1)a[j][k+h]=a[j][k]+h;
    }
    for(int j=1; j<=h; j=j+1)
    {
      for(int k=1; k<=h; k=k+1)
      {
        a[j+h][k]=a[j][k+h];
        a[j+h][k+h]=a[j][k];
      }
    }
    h=h*2;
  }
  for(int i=1; i<=n; i=i+1)
  {
    for(int j=1; j<=n; j=j+1)
    {
      //printf("%d ",a[i][j]);
      if(a[i][j]>9)printf("%d  ",a[i][j]);
      else printf("%d   ",a[i][j]);
    }
    printf("\n");
  }
  return 0;
}