The Brick Factory Problem
Imagine you are at the brick factory making bricks. You have a number of kilns k and a number of storages s. And you want to connect every kiln with every storage with the minimum possible number of tracks intersections. Notice, that it's not necessary for tracks to be straight (scheme 1).
Another variant of this problem is to find the minimum number of intersections while connecting every element with all others in k sequence (scheme 2).
Your function must return the minimum number of intersections in the variant 1 (two arguments) or variant 2 (one argument), depending of the number of given arguments.
Here is a video with wider explanation of the problems, examples, schemes and formulas 😉. Notice, that the formulas are not fully proven yet and it may be your next own study!
Input: Two or one integer (int)
Output: Integer.
Examples:
assert crosses(1, 1) == 0 assert crosses(5) == 1 assert crosses(5, 5) == 16 assert crosses(7) == 9
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.
