Tasks Details
easy
1.
FrogJmp
Count minimal number of jumps from position X to Y.
Task Score
100%
Correctness
100%
Performance
100%
A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D.
Count the minimal number of jumps that the small frog must perform to reach its target.
Write a function:
function solution(X, Y, D);
that, given three integers X, Y and D, returns the minimal number of jumps from position X to a position equal to or greater than Y.
For example, given:
X = 10 Y = 85 D = 30the function should return 3, because the frog will be positioned as follows:
- after the first jump, at position 10 + 30 = 40
- after the second jump, at position 10 + 30 + 30 = 70
- after the third jump, at position 10 + 30 + 30 + 30 = 100
Write an efficient algorithm for the following assumptions:
- X, Y and D are integers within the range [1..1,000,000,000];
- X ≤ Y.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 4 minutes
Notes
not defined yet
Code: 10:31:06 UTC,
java,
autosave
Code: 10:34:34 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(X, Y, D) {
// write your code in JavaScript (Node.js 8.9.4)
return Math.ceil((Y-X)/D)
}
User test case 1:
[10, 85, 30]
User test case 2:
[1, 10, 1]
User test case 3:
[200, 400, 200]
User test case 4:
[200, 401, 200]
User test case 5:
[1, 1000000000, 1]
User test case 6:
[1, 500, 1000]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 9
function result: 9
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 999999999
function result: 999999999
1.
0.068 s
OK
function result: 1
function result: 1
Code: 10:35:02 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(X, Y, D) {
// write your code in JavaScript (Node.js 8.9.4)
return Math.ceil((Y-X)/D)
}
User test case 1:
[10, 85, 30]
User test case 2:
[1, 10, 1]
User test case 3:
[200, 400, 200]
User test case 4:
[200, 401, 200]
User test case 5:
[1, 1000000000, 1]
User test case 6:
[1, 500, 1000]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 9
function result: 9
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 999999999
function result: 999999999
1.
0.068 s
OK
function result: 1
function result: 1
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(1)
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK