算法学习与联系记录

n = int(input())
li = []
for _ in range(n):
    li.append(input())
sm = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
    for j in range(1, n + 1):
        sm[i][j] = sm[i - 1][j] + sm[i][j - 1] + int(li[i - 1][j - 1]) - sm[i - 1][j - 1]

for k in range(1, n + 1):
    t = k * k
    if t % 2:
        print(0)
        continue
    cnt = 0
    for i in range(k, n + 1):
        for j in range(k, n + 1):
            if sm[i][j] - sm[i - k][j] - sm[i][j - k] + sm[i - k][j - k] == t // 2:
                cnt += 1
    print(cnt)