Pagini recente » Cod sursa (job #890693) | Cod sursa (job #590743) | Cod sursa (job #886827) | Cod sursa (job #1535376) | Cod sursa (job #2430899)
#include <fstream>
using namespace std;
ifstream fin("zoo.in");
ofstream fout("zoo.out");
const int nmax = 105;
long long M[nmax][nmax], s[nmax][nmax];
int n, m, q;
void sumepartiale()
{
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + M[i][j];
}
void read()
{
fin >> n >> m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
fin >> M[i][j];
sumepartiale();
}
void solve()
{
fin >> q;
for(int k = 1; k <= q; ++k)
{
int a, b, c, d;
fin >> a >> b >> c >> d;
fout << s[c][d] - s[a - 1][d] - s[c][b - 1] + s[a - 1][b - 1] << "\n";
}
}
int main()
{
read();
solve();
return 0;
}