Tasks Details
medium
1.
CountDiv
Compute number of integers divisible by k in range [a..b].
Task Score
50%
Correctness
100%
Performance
0%
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: 17:16:53 UTC,
java,
autosave
Code: 17:17:00 UTC,
swift4,
verify,
result: Passed
import Foundation
import Glibc
// you can write to stdout for debugging purposes, e.g.
// print("this is a debug message")
public func solution(_ A : Int, _ B : Int, _ K : Int) -> Int {
// write your code in Swift 4.2.1 (Linux)
var sum = 0
for index in A...B {
if index % K == 0 {
sum += 1
}
}
return sum
}
Analysis
Code: 17:17:06 UTC,
swift4,
verify,
result: Passed
import Foundation
import Glibc
// you can write to stdout for debugging purposes, e.g.
// print("this is a debug message")
public func solution(_ A : Int, _ B : Int, _ K : Int) -> Int {
// write your code in Swift 4.2.1 (Linux)
var sum = 0
for index in A...B {
if index % K == 0 {
sum += 1
}
}
return sum
}
Analysis
Code: 17:17:14 UTC,
swift4,
final,
score:
50
import Foundation
import Glibc
// you can write to stdout for debugging purposes, e.g.
// print("this is a debug message")
public func solution(_ A : Int, _ B : Int, _ K : Int) -> Int {
// write your code in Swift 4.2.1 (Linux)
var sum = 0
for index in A...B {
if index % K == 0 {
sum += 1
}
}
return sum
}
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)
expand all
Correctness tests
1.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
4.
0.028 s
OK
5.
0.028 s
OK
6.
0.028 s
OK
expand all
Performance tests
1.
1.308 s
TIMEOUT ERROR,
running time: 1.308 sec., time limit: 0.128 sec.
big_values2
A = 101, B = 123M+, K = 10K
A = 101, B = 123M+, K = 10K
✘
TIMEOUT ERROR
running time: 1.304 sec., time limit: 0.112 sec.
running time: 1.304 sec., time limit: 0.112 sec.
1.
1.304 s
TIMEOUT ERROR,
running time: 1.304 sec., time limit: 0.112 sec.
big_values3
A = 0, B = MAXINT, K in {1,MAXINT}
A = 0, B = MAXINT, K in {1,MAXINT}
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
0.028 s
OK
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
0.028 s
OK
4.
0.028 s
OK