python 代码

n,l,r,t = map(int,input().split())
mp = [[0 for i in range(n + 1)] for j in range(n + 1)]
num = 0
for i in range(1,n + 1):
    a = [0] + list(map(int,input().split()))
    mp[i] = a
s = [[0 for i in range(n + 1)] for j in range(n + 1)]
for i in range(1,n + 1):
    for j in range(1,n + 1):
        s[i][j] = mp[i][j] - s[i - 1][j - 1] + s[i - 1][j] + s[i][j - 1]
for i in range(1,1 + n):
    for j in range(1,n + 1):
        x1,y1,x2,y2 = max(i - r,1),max(j - r,1),min(i + r,n),min(j + r,n)
        ans = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]
        area = (x2 - x1 + 1) * (y2 - y1 + 1)
        ans = ans / area
        if ans <= t:
            num = num + 1
print(num)