Count Divisibles in Range (simplified)

Count Divisibles in Range (simplified)

给定两个整数nk ,任务是数出 1 到n (含)之间有多少个数能被k 整除。

example

输入:两个整数 (int).

输出:整数 (int).

示例

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