Tasks Details
medium
1.
CountDiv
Compute number of integers divisible by k in range [a..b].
Task Score
75%
Correctness
100%
Performance
50%
Write a function:
function 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.
Write an efficient algorithm for the following assumptions:
- 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.
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Total time used 1 minutes
Effective time used 1 minutes
Notes
not defined yet
Task timeline
Code: 16:01:25 UTC,
java,
autosave
Code: 16:01:29 UTC,
js,
verify,
result: Passed
Analysis
Code: 16:01:31 UTC,
js,
verify,
result: Passed
Analysis
Code: 16:01:33 UTC,
js,
final,
score: 
75
Analysis summary
The following issues have been detected: timeout errors.
For example, for the input [0, 2000000000, 1] the solution exceeded the time limit.
Analysis
Detected time complexity:
O((B-A)/K)
expand all
Correctness tests
1.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
expand all
Performance tests
1.
0.176 s
OK
1.
0.072 s
OK
big_values3
A = 0, B = MAXINT, K in {1,MAXINT}
A = 0, B = MAXINT, K in {1,MAXINT}
✘
TIMEOUT ERROR
running time: 3.31 sec., time limit: 0.29 sec.
running time: 3.31 sec., time limit: 0.29 sec.
1.
3.308 s
TIMEOUT ERROR,
running time: 3.31 sec., time limit: 0.29 sec.
2.
0.072 s
OK
1.
0.072 s
OK
2.
3.308 s
TIMEOUT ERROR,
running time: 3.31 sec., time limit: 0.29 sec.
3.
0.072 s
OK
4.
0.072 s
OK