Submission #1612204

---

Source Code Expand

# coding:utf-8

import numpy as np

N = int(input())
D = []
for i in range(N):
    D.append([int(x) for x in input().split(' ')])
D = np.array(D)

Q = int(input())
P = []
for i in range(Q):
    P.append(int(input()))

for i in P:
    maximum = 0
    for j in range(N, 0, -1):
        if i // j == 1:
            for k in range(0, N):
                for l in range(0, N - j + 1):
                    x = np.sum(D[k, l: l + j])
                    y = np.sum(D[l: l + j, k])
                    if x > y:
                        if x > maximum:
                            maximum = x
                    elif y > maximum:
                        maximum = y
            else:
                pass
        elif i // j > 1:
            if i // j > j:
                break
            else:
                for k in range(0, N - (i // j) + 1):
                    for l in range(0, N - j + 1):
                        x = np.sum(D[k: k + (i // j), l:l + j])
                        y = np.sum(D[l: l + j, k: k + (i // j)])
                        if x > y:
                            if x > maximum:
                                maximum = x
                        elif y > maximum:
                            maximum = y
    print(maximum)

Submission Info

Judge Result