Codility and other programming lessons: Lesson 1: FrogJmp (Frog Jmp)
This one is quite easy.
This one is quite easy.
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:
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.
int solution(int X, int Y, int D) {
int distance = Y - X;
return distance % D == 0 ? distance / D : distance / D + 1;
}
Read full article from Codility and other programming lessons: Lesson 1: FrogJmp (Frog Jmp)