![Dangerous Bishops](https://d17mnqrx9pmt3e.cloudfront.net/media/logos/task/middle/dangerous-bishops-unsolved.png)
Dangerous Bishops
![](https://d17mnqrx9pmt3e.cloudfront.net/media/missions/media/e64ce47d18ad4c799a8843e10ec8ca19/convert/grey/title.png)
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: Integer.
Examples:
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
The mission was taken from Python CCPS 109. It is taught for Ryerson Chang School of Continuing Education by Ilkka Kokkarinen
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
checkio sync
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium
Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.
Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!
You are trying to join a pair programming session that has not started yet.
Please wait for the session creator to join.
It looks like the creator of the pair programming session closed the editor window.
It might happen accidentally, so that you can wait for reconnection.