题目链接
找规律题。通过观察易得到如下递推式:(a[i][j]表示第i层,第j个位置的砖的数字)
(1) a[i+2][j+1]=(a[i][j]-a[i+2][j]-a[i+2][j+2])/2;
(2) a[i+1][j]=a[i+2][j+1]+a[i+2][j];
(3) a[i+1][j+1]=a[i+2][j+1]+a[i+2][j+2];
#include<cstdio>
#include<cstring>
int a[10][10];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
scanf("%d",&t);
while(t--)
{
memset(a,0,sizeof(a));
for(int i=0;i<9;i+=2)
for(int j=0;j<i+1;j+=2)
scanf("%d",&a[i][j]);
for(int i=6;i>=0;i-=2)
for(int j=0;j<i+1;j+=2)
{
a[i+2][j+1]=(a[i][j]-a[i+2][j]-a[i+2][j+2])/2;
a[i+1][j]=a[i+2][j+1]+a[i+2][j];
a[i+1][j+1]=a[i+2][j+1]+a[i+2][j+2];
}
for(int i=0;i<9;i++)
for(int j=0;j<i+1;j++)
printf("%d%c",a[i][j],i==j?'\n':' ');
}
return 0;
}