Count Divisibles in Range (simplified)

Count Divisibles in Range (simplified)

Elementary+

Given two integers, n and k, the task is to count how many numbers between 1 and n (inclusive) are divisible by k.

example

Input: Two integers (int).

Output: Integer (int).

Examples: 

assert count_divisible(10, 2) == 5
assert...
You should be an authorized user in order to see the full description and start solving this mission.
40
freeman_lex