3.1 FrogJmp

FrogJmp

Count minimal number of jumps from position X to Y.

Solution

int solution(int X, int Y, int D) { // write your code in C++11 (g++ 4.8.2) return (Y - X + (D - 1)) / D; }