题目链接:http://codeforces.com/contest/610/problem/C
还是看的卿神的题解…照旧
#include<bits/stdc++.h>
using namespace std;
int dp[1000][1000];
int main(int argc, char const *argv[])
{ dp[0][0]=1;
int n;
scanf("%d",&n);
for (int x = 1; x <=n; ++x)
{
for (int i = 0; i <(1<<x-1); ++i)
{
for (int j = 0; j<(1<<x-1); ++j)
{
dp[i][j+(1<<x-1)]=dp[i][j];
dp[i+(1<<x-1)][j]=dp[i][j];
dp[i+(1<<x-1)][j+(1<<x-1)]=1-dp[i][j];
}
}
}
for (int i = 0; i <(1<<n); ++i)
{
for (int j = 0; j <(1<<n); ++j)
{
if (dp[i][j]==1)
{
printf("+");
}
else{
printf("*" );
}
}
printf("\n");
}
return 0;
}
打出输入为2的结果是这样:
1 1 1 1
1 0 1 0
1 1 0 0
1 0 0 1
①这样形成的三个数是联动的,数学证明给不出来….但是就应该是这样构造….相邻的两个奇数列和偶数列的乘积和是0显然。假如是第二列和第三列,前两个数同第一列和第二列,后两个数等于乘-1乘-1,积不变
②<< 左移运算符 1<<2 1左移2位
PS:记得在判读语句中加(1<<2)