백준 문제 2167 - 2차원 배열의 합

#include

using namespace std;

int main()
{ int i, j;
int arr[300][300];
cin >> i >> j;
for (int a = 0; a < i; a++) {
for (int b = 0; b < j; b++)
{
cin >> arr[a][b];
}
}
int x, y,k;
cin >> k;
for (int c = 0; c < k; c++) {
cin >> i >> j >> x >> y;
i--;
j--;
x--;

y--;
int acc = 0;
for (int a = i; a <= x; a++) {
for (int b = j; b <= y; b++) {
acc = acc + arr[a][b];
}
}
cout << acc << endl;
}
}