POJ 1656 Counting Black

//简单模拟
#include <stdio.h>
#define csMax 101

int main()
{
int i, j, k;
int nCommands;
int x[csMax], y[csMax], L[csMax];
int flag[csMax][csMax]={0};
char command[csMax][6];
int a1, b1, count, temp;

while (1==scanf("%d", &nCommands))
{
i=0;
while(nCommands--)
{
scanf(" %s %d %d %d", command[i], &x[i], &y[i], &L[i]);

if(command[i][0]=='T')
{
temp=i;

count=0;
for(j=x[temp]; j<=x[temp]+L[temp]-1; j++)
for(k=y[temp]; k<=y[temp]+L[temp]-1; k++)
if(flag[j][k]==1)
count++;
printf("%d/n", count);

}
else
{
a1=x[i]+L[i]-1; b1=y[i]+L[i]-1;
if(command[i][0]=='B')
for(j=x[i]; j<=a1; j++)
for(k=y[i]; k<=b1; k++)
flag[j][k]=1;
else
for(j=x[i]; j<=a1; j++)
for(k=y[i]; k<=b1; k++)
flag[j][k]=0;
}

i++;
}

}

return 0;
}