app.codility.com/programmers/lessons/3-time_complexity/frog_jmp/
# X -> Y 도달하기 위해 필요한 점프 수
def solution(X, Y, D):
if (Y - X) % D == 0:
return (Y - X) // D
else:
return (Y - X) // D + 1
print(solution(10, 85, 30)) # 3
'Codility' 카테고리의 다른 글
[Lesson 6][Sorting] Distinct (0) | 2021.05.07 |
---|---|
[Lesson 5][Prefix Sums] CountDiv (0) | 2021.05.07 |
[Lesson 4][Counting Elements] FrogRiverOne (0) | 2021.05.07 |
[Lesson 2][Arrays] CyclicRotation (0) | 2021.05.07 |
[Lesson 1][Iterations] BinaryGap (0) | 2021.05.07 |