#include <iostream>
using namespace std;
int ar[601][601], sum[601][601];
int main() {
/*
二维数组前缀和,求区间内的和
*/
int n, l, r;
float t;
cin >> n >> l >> r >> t;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++) {
cin >> ar[i][j];
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + ar[i][j];
}
int xl, xr, yt, yb, sumVal, cnt = 0;
float avgVal;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++) {
xl = j - r >= 1 ? j - r : 1;
xr = j + r <= n ? j + r : n;
yt = i - r >= 1 ? i - r : 1;
yb = i + r <= n ? i + r : n;
sumVal = sum[yb][xr] - sum[yb][xl - 1] - sum[yt - 1][xr] + sum[yt - 1][xl - 1];
avgVal = (float)sumVal / ((yb - yt + 1) * (xr - xl + 1));
if(avgVal <= t)
cnt ++;
}
cout << cnt;
}
典型的二维数组求前缀和问题,需要注意的是边界的判断,如果小于1或大于n 就要取1或n