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:
class Solution { public int solution(int X, int Y, int 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–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Total time used 9 minutes
Effective time used 9 minutes
Notes
not defined yet
Task timeline
Code: 19:27:59 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
if(X > Y || X == Y) return 0;
int steps = 0;
while(Y > X)
{
X+=D;
steps++;
}
return steps;
}
}
Code: 19:28:10 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
if(X > Y || X == Y) return 0;
int steps = 0;
while(Y > X)
{
X+=D;
steps++;
}
return steps;
}
}
Code: 19:29:59 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
}
}
Code: 19:30:10 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
if()
}
}
Code: 19:34:22 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int
}
}
Code: 19:34:34 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if()
{
}else{
}
}
}
Code: 19:34:50 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if((Y-X)%D == 0)
{
}else{
}
}
}
Code: 19:35:05 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if((Y-X)%D == 0)
{
}else{
}
return iStep;
}
}
Code: 19:35:36 UTC,
java,
autosave
// 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if((Y-X)%D == 0)
{
iStep = (Y-X)/D;
}else{
iStep = (U-)/D;
}
return iStep;
}
}
Code: 19:35:48 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if((Y-X)%D == 0)
{
iStep = (Y-X)/D;
}else{
iStep = ((Y-X)/D)+1;
}
return iStep;
}
}
Analysis
Code: 19:35:56 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if((Y-X)%D == 0)
{
iStep = (Y-X)/D;
}else{
iStep = ((Y-X)/D)+1;
}
return iStep;
}
}
Analysis
Code: 19:36:01 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 X, int Y, int D) {
// write your code in Java SE 8
// if(X > Y || X == Y) return 0;
// int steps = 0;
// while(Y > X)
// {
// X+=D;
// steps++;
// }
// return steps;
int iStep = 0;
if((Y-X)%D == 0)
{
iStep = (Y-X)/D;
}else{
iStep = ((Y-X)/D)+1;
}
return iStep;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(1)
expand all
Correctness tests
1.
0.008 s
OK
2.
0.004 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.004 s
OK