Determine the remainder from division of two positive integers.
Input: Two integers (int): dividend (the number to be divided) and divisor (the number by which division is to be performed).
Output: Integer (int).
assert find_remainder(10, 3) == 1 assert find_remainder(14, 4) == 2 assert find_remainder(27, 4) == 3 assert find_remainder(10, 5) == 0
How it’s used: remainder calculations are common in algorithms, especially in modular arithmetic which is frequently used in cryptography and computer graphics.
- dividend, divisor > 0.
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
(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 --ff
checkio install-plugin --chromium