矩陣變幻_2019 CSPJ 程序填空第1題

#include?<bits/stdc++.h>
#include?<cstdio>
using?namespace?std;
int?n;
const?int?max_size=1<<10;
int?res[max_size][max_size];
void?recursive(int?x,int?y,int?n,int?t)?{
????if?(n==0)?{
????????res[x][y]=t;
????????return;
????}
????int?step=1<<(n-1);
????recursive(x,y,n-1,t);
????recursive(x,y+step,n-1,t);
????recursive(x+step,y,n-1,t);
????recursive(x+step,y+step,n-1,!t);
}
int?main()?{
????scanf("%d",&n);
????recursive(0,0,n,0);
????int?size=1<<n;
?for?(int?i=0;i<size;i++)?{
????????for?(int?j=0;j<size;j++)
????????????printf("%d",res[i][j]);
????????puts("");
????}
?
01:58
?????return?0;
}???
標(biāo)簽: