Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
I'm lazy solution in Clear category for Dangerous Bishops by U.V
def safe_squares(n: int, bishops: tuple[int, int]) -> int:
fld=set((i,j) for i in range(n) for j in range(n))
for i,j in bishops:
for k in range(n):
fld.discard((i + k, j + k))
fld.discard((i - k, j + k))
fld.discard((i + k, j - k))
fld.discard((i - k, j - k))
return len(fld)
print("Example:")
print(safe_squares(10, []))
# These "asserts" are used for self-checking
assert safe_squares(10, []) == 100
assert safe_squares(4, [(2, 3), (0, 1)]) == 11
assert safe_squares(8, [(1, 1), (3, 5), (7, 0), (7, 6)]) == 29
print("The mission is done! Click 'Check Solution' to earn rewards!")
April 28, 2024
