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 = 30`

the 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–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

Solution

Programming language used JavaScript

Time spent on task 3 minutes

Notes

*not defined yet*

Task timeline

Code: 08:23:11 UTC,
java,
autosave

Code: 08:24:35 UTC,
js,
verify,
result:

**Failed**
Analysis

expand all

**Example tests**
1.

0.108 s

**RUNTIME ERROR**, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

Code: 08:25:34 UTC,
js,
verify,
result:

**Failed**
Analysis

expand all

**Example tests**
1.

0.072 s

**RUNTIME ERROR**, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:

3

Code: 08:25:43 UTC,
js,
verify,
result:

**Passed**
Analysis

Code: 08:25:49 UTC,
js,
verify,
result:

**Passed**
Analysis

Code: 08:25:53 UTC,
js,
final,
score:

**100**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**