Count Divisibles in Range (simplified)

Count Divisibles in Range (simplified)

Undefined

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 (number).

Output: Integer (number).

Examples: 

assert.strictEqual(countDivisible(10, 2), 5);
assert.strictEqual(countDivisible(10,...
You should be an authorized user in order to see the full description and start solving this mission.
17
freeman_lex