poj 1195

#include <stdio.h>
#include <string.h>
#define maxn 1035
int C[maxn][maxn];
int S;
int lowbit(int t){
return t&(-t);
}
int Sum(int i, int j){
int result = 0;
for(int x = i;x > 0;x -= lowbit(x)){
for(int y = j;y > 0;y -= lowbit(y)){
result += C[x][y];
}
}
return result;
}

void Modify(int i, int j, int delta){
for(int x = i;x <= S;x += lowbit(x))
for(int y = j;y <= S;y += lowbit(y)){
C[x][y] += delta;
}
}

int main()
{
int ins, x, y, a, l, b, r, t;
while(scanf("%d %d", &ins, &S) != EOF)
{
memset(C, 0, sizeof(C));
while(scanf("%d", &ins)&&ins != 3)
{
if(ins == 1){
scanf("%d %d %d", &x, &y, &a);
Modify(x + 1, y + 1, a);
}
if(ins == 2){
scanf("%d %d %d %d", &l, &b, &r, &t);
l++, b++, r++, t++;
printf("%d\n", Sum(r, t) - Sum(l - 1, t) - Sum(r, b - 1) + Sum(l - 1, b - 1));
}
}
}
}