백준/백준-C++
2167번: 2차원 배열의 합
Beabletoet
2017. 9. 4. 17:55
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | #include<cstdio> int main() { int num[301][301], n, m, i, j, x, y, ans = 0; scanf("%d %d", &n, &m); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) scanf("%d", &num[i][j]); for (scanf("%d", &n); n--; ans = 0) { scanf("%d %d %d %d", &i, &j, &x, &y); for (int ii = i; ii <= x; ++ii) for (int jj = j; jj <= y; ++jj) ans += num[ii][jj]; printf("%d\n", ans); } } | cs |