Codility编程课一CountDiv（Compute number of integers divisible by k in range [a..b]）

CountDiv

Compute number of integers divisible by k in range [a..b].

Task description

Write a function:

def solution(A, B, K)

that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.:

{ i : A ≤ i ≤ B, i mod K = 0 }

For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10.

Assume that:

A and B are integers within the range [0..2,000,000,000];
K is an integer within the range [1..2,000,000,000];
A ≤ B.
Complexity:

expected worst-case time complexity is O(1);
expected worst-case space complexity is O(1).

测试用例：

print solution(0, 2000000000, 2000000000)
print solution(11,345,17)
print solution(10, 10, 20)
print solution(11, 14, 2)
print solution(2,23,34)
print solution(0, 0, 11)
print solution(6, 11, 11)
print solution(6, 11, 2)
print solution(0,2,2)

python int()函数是向下取整的：

>>> int(1.2)
1
>>> int(1.6)
1
>>> int(1.8)
1