Count Divisibles in Range (simplified)
Given two integers, n and k, the task is to count how many numbers between 1 and n (inclusive) are divisible by k.
Input: Two integers (int).
Output: Integer (int).
Examples:
assert count_divisible(10, 2) == 5 assert count_divisible(10, 3) == 3 assert count_divisible(10, 5) == 2 assert count_divisible(15, 4) == 3
How it’s used: this function can be useful in number theory problems, statistical computations, and various other mathematical and practical scenarios where such a count is needed.
Precondition:
- 1 <= k <= n <= 109.
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.
