Dangerous Bishops
The generalized square chessboard has been taken over by an army of bishops, each bishop represented as a two-tuple (row, col) (0-base indexing) of the coordinates of the square that the bishop stands on. Given the board size n and the list of bishops on that board, count the number of safe squares that are not covered by any bishop.
Let's look at the case 4, [(2, 3), (0, 1)], which is 11.
Input: Two arguments. Integer (int) and list of tuples of two integers.
Output:...
You should be an authorized user in order to see the full description and start solving this mission.
