[BAEKJOON] 2167 2차원 배열의 합

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> using namespace std; int main() { vector<vector<int>>map(301, vector<int>(301,0)); int row, colum; scanf("%d %d", &row, &colum); for (int x = 1; x <= row; x++) { for (int y = 1; y <= colum; y++) scanf("%d", &map[x][y]); } int n,start_x,start_y,end_x,end_y,answer; scanf("%d", &n); for (int j = 0; j < n; j++) { answer = 0; scanf("%d %d %d %d", &start_x, &start_y, &end_x, &end_y); for (int x = start_x; x <= end_x; x++) { for (int y = start_y; y <= end_y; y++) answer += map[x][y]; } printf("%d\n", answer); } return 0; }