Tasks Details
medium
1.
CountDiv
Compute number of integers divisible by k in range [a..b].
Task Score
100%
Correctness
100%
Performance
100%
Write a function:
class Solution { public int solution(int A, int B, int 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 Java 8
Time spent on task 1 minutes
Notes
not defined yet
Task timeline
Code: 10:38:22 UTC,
java,
autosave
Code: 10:38:25 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int A, int B, int K) {
// write your code in Java SE 8
if (K == 1 || (A == B && B == K)){
return B - A + 1;
}
int result = 0;
int mock = (A > K) ? (A / K) : 0;
int namugi = A % K;
if (namugi > 0 && B < K) {
mock += 1;
}
result = (B >= K) ? ((B - (K * mock)) / K) : 0;
if (namugi == 0) {
result++;
}
return result;
}
}
Analysis
Code: 10:38:29 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int A, int B, int K) {
// write your code in Java SE 8
if (K == 1 || (A == B && B == K)){
return B - A + 1;
}
int result = 0;
int mock = (A > K) ? (A / K) : 0;
int namugi = A % K;
if (namugi > 0 && B < K) {
mock += 1;
}
result = (B >= K) ? ((B - (K * mock)) / K) : 0;
if (namugi == 0) {
result++;
}
return result;
}
}
Analysis
Code: 10:38:35 UTC,
java,
final,
score:
100
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(int A, int B, int K) {
// write your code in Java SE 8
if (K == 1 || (A == B && B == K)){
return B - A + 1;
}
int result = 0;
int mock = (A > K) ? (A / K) : 0;
int namugi = A % K;
if (namugi > 0 && B < K) {
mock += 1;
}
result = (B >= K) ? ((B - (K * mock)) / K) : 0;
if (namugi == 0) {
result++;
}
return result;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(1)
expand all
Correctness tests
1.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.004 s
OK
5.
0.004 s
OK
6.
0.004 s
OK
expand all
Performance tests
1.
0.004 s
OK
1.
0.004 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK