hdu 3584 cube #三维树状数组

/**
尽管还是没怎么想通这题为什么可以这样解，
权当是拿来练练三维树状数组了。
*/
#include <stdio.h>
#include <string.h>
#define lowbit(i) (i) & (-i)
#define N 128
int a[N][N][N];

void update(int i,int j,int k)
{
    for(; i < N; i += lowbit(i))
        for(int jj = j; jj < N; jj += lowbit(jj))
            for(int kk = k; kk < N; kk += lowbit(kk))
                a[i][jj][kk] = !a[i][jj][kk];
}
int sum(int i,int j,int k)
{
    int sum = 0;
    for(; i > 0; i -= lowbit(i))
        for(int jj = j; jj > 0; jj -= lowbit(jj))
            for(int kk = k; kk > 0; kk -= lowbit(kk))
                sum += a[i][jj][kk];
    return sum&1;
}
int main()
{
    int com,n,m,x1,y1,z1,x2,y2,z2;
    wh