UVA11040 - Add bricks in the wall

#include <iostream>
#include <cstring>

using namespace std;
const int maxn=9;
int tab[10][10];

int main(){
    int T;
    cin>>T;
    while(T--){
        memset(tab,0,sizeof(tab));
        for(int i=0; i<maxn; i+=2)
        for(int j =0;j<=i;j+=2){
            cin>>tab[i][j];
        }
        for(int i=maxn-3;i>=0; i-=2){
            for(int j =0;j<=i; j+=2){
                tab[i+2][j+1]=(tab[i][j]-tab[i+2][j]-tab[i+2][j+2])>>1;
                tab[i+1][j]=tab[i+2][j]+tab[i+2][j+1];
                tab[i+1][j+1]=tab[i+2][j+1]+tab[i+2][j+2];
            }
        }
        for(int i =0; i<9; i++){
            for(int j =0; j<=i; j++){
                cout<<tab[i][j]<<(i==j? "\n":" ");
            }
        }
    }
    return 0;
}