def makematrix(ii,jj,a,b): n=[[0]*b for _ in range(a)] for i in range(a): for j in range(b): n[i][j]=((i+ii+1)*(j+jj+1) %10) return max([max(i) for i in n]) import numpy as np num=[int(i) for i in input().split()] def duxiaoman(n,m,a,b): # matrix1=[[0]*m for _ in range(n)] sum=0 # for i in range(n): # for j in range(m): # matrix1[i][j]=((i+1)*(j+1))%10 # matrix1=np.array(matrix1) for i in range(n): if i+a<=m: for j in range(m): # print(i+a) # print(j+b) if (j+b)<=n: # son=matrix1[i:i+a,j:j+b] son=makematrix(i,j,a,b) # sum+=max([max(i) for i in son]) sum+=son # print(sum) else: break else: break return sum # res=duxiaoman(num[0],num[1],num[2],num[3]) print(res)
我也觉得我这个可以全a 奈何没时间了。