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:
def 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 Python
Time spent on task 4 minutes
Notes
not defined yet
Code: 13:27:10 UTC,
java,
autosave
Analysis
Analysis
expand all
User tests
1.
0.036 s
OK
function result: 0
function result: 0
1.
0.036 s
OK
function result: 30
function result: 30
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last): File "exec.py", line 131, in <module> main() File "exec.py", line 93, in main result = solution( X, Y, D ) File "/tmp/solution.py", line 7, in solution i = N // D ZeroDivisionError: integer division or modulo by zero
User test case 1:
[10, 10, 20]
User test case 2:
[10, 40, 1]
User test case 3:
[30, 30, 0]
Analysis
expand all
User tests
1.
0.036 s
OK
function result: 0
function result: 0
1.
0.036 s
OK
function result: 30
function result: 30
1.
0.036 s
OK
function result: 0
function result: 0
User test case 1:
[10, 10, 20]
User test case 2:
[10, 40, 1]
User test case 3:
[30, 30, 0]
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(1)
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK