iOYES iOYES

아래 문제는 코딜리티에서 제공하는 FlogJmp의 문제입니다🧑🏻‍💻 문제 제시 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(in..