백준 풀이
백준 2167번 파이썬
ag2개발자
2022. 8. 22. 21:49
n,m= map(int, input().split())
a=[]
dp = [[0] * (m + 1) for _ in range(n + 1)]
for _ in range(n):
a.append(list(map(int, input().split())))
for p in range(1,n+1):
for q in range(1, m+1):
dp[p][q]= a[p-1][q-1]+dp[p-1][q]+dp[p][q-1]-dp[p-1][q-1]
u=int(input())
for k in range(u):
i,j,x,y=map(int, input().split())
print(dp[x][y]-dp[x][j-1]-dp[i-1][y]+dp[i-1][j-1])