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
Time spent on task 7 minutes
Notes
not defined yet
Task timeline
Code: 10:25:05 UTC,
java,
verify,
result: Failed
// 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
int tempX=X;
if(X>=Y)
return 0;
else{
int value=(Y-X)/D;
int value2=(Y-X)%D;
if(balue2)
value++;
}
return count;
}
}
Analysis
Compile error
Solution.java:17: error: cannot find symbol
if(balue2)
^
symbol: variable balue2
location: class Solution
Solution.java:17: error: illegal start of type
if(balue2)
^
Solution.java:20: error: cannot find symbol
return count;
^
symbol: variable count
location: class Solution
3 errors
Code: 10:25:18 UTC,
java,
verify,
result: Failed
// 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
int tempX=X;
if(X>=Y)
return 0;
else{
int value=(Y-X)/D;
int value2=(Y-X)%D;
if(value2)
value++;
}
return count;
}
}
Analysis
Compile error
Solution.java:17: error: incompatible types: int cannot be converted to boolean
if(value2)
^
Solution.java:20: error: cannot find symbol
return count;
^
symbol: variable count
location: class Solution
2 errors
Code: 10:25:32 UTC,
java,
verify,
result: Failed
// 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
int tempX=X;
if(X>=Y)
return 0;
else{
int value=(Y-X)/D;
int value2=(Y-X)%D;
if(value2)
value++;
}
return value;
}
}
Analysis
Compile error
Solution.java:17: error: incompatible types: int cannot be converted to boolean
if(value2)
^
Solution.java:20: error: cannot find symbol
return value;
^
symbol: variable value
location: class Solution
2 errors
Code: 10:27:20 UTC,
java,
verify,
result: Failed
// 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
int value;
if(X>=Y)
return 0;
else{
value=(Y-X)/D;
int value2=(Y-X)%D;
if(value2)
value++;
}
return value;
}
}
Analysis
Compile error
Solution.java:17: error: incompatible types: int cannot be converted to boolean
if(value2)
^
1 error
Code: 10:27:40 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
int value;
if(X>=Y)
return 0;
else{
value=(Y-X)/D;
int value2=(Y-X)%D;
if(value2>0)
value++;
}
return value;
}
}
Analysis
Code: 10:27: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
int value;
if(X>=Y)
return 0;
else{
value=(Y-X)/D;
int value2=(Y-X)%D;
if(value2>0)
value++;
}
return value;
}
}
Analysis
Code: 10:27:53 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
int value;
if(X>=Y)
return 0;
else{
value=(Y-X)/D;
int value2=(Y-X)%D;
if(value2>0)
value++;
}
return value;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(1)
expand all
Correctness tests
1.
1.385 s
OK
2.
1.407 s
OK
1.
1.423 s
OK
2.
1.427 s
OK
1.
1.415 s
OK
2.
1.436 s
OK
1.
1.430 s
OK