Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Dangerous Bishops by Magu
def covered(n, x):
l = []
for i in range(n):
for j in range(n):
if i - j == x[1] - x[0]:
l.append((j, i))
elif i + j == x[1] + x[0]:
l.append((j, i))
return l
def safe_squares(n: int, bishops: list[tuple[int, int]]) -> int:
lst = [[0] * n for _ in range(n)]
for t in bishops:
lst[t[1]][t[0]] = 1
for ct in covered(n, t):
lst[ct[1]][ct[0]] = 1
return sum(lst, []).count(0)
Oct. 7, 2024
