Untitled

//14045 - Final Battle with Penguin07
#include <stdio.h>
#include <stdlib.h>
int num[10005][10005] = {0};
int prefix[10005][10005] = {0};
int main(void)
{
    int n, m, k, q;
    int i, j, z;
    int c;

    scanf("%d %d %d %d", &n, &m, &k, &q);

    for(i = 0;i<n;i++)
    {
        for(j = 0;j<m;j++)
        {
            {
                scanf("%d", &num[i][j]);
            }
        }
    }
    
    for(i = 1;i<=n;i++)//計算二維陣列前綴和
    {
        for(j = 1;j<=m;j++)
        {
            prefix[i][j] = num[i][j];
            if(i > 1) prefix[i][j] = prefix[i-1][j];
            if(j > 1) prefix[i][j] = prefix[i][j-1];
            if(i > 1 && j > 1) prefix[i][j] -= prefix[i-1][j-1];
        }
    }