문제링크
https://app.codility.com/programmers/lessons/3-time_complexity/frog_jmp/
FrogJmp coding task - Learn to Code - Codility
Count minimal number of jumps from position X to Y.
app.codility.com
풀이
import math
def solution(X, Y, D):
return math.ceil((Y-X)/D)Y보다 크거나 같게 점프한다고 했으니 올림을 해준다. 처음엔 반올림을 생각했는데 틀렸다해서 올림을 썼다.
'Problem Solving > Codility' 카테고리의 다른 글
| [Codility Python] lesson 3 Time Complexity - TapeEquilibrium (0) | 2022.07.07 |
|---|---|
| [Codility Python] lesson 3 Time Complexity - PermMissingElem (0) | 2022.07.07 |
| [Codility Python] lesson 2 Arrays - OddOccurrencesInArray (0) | 2022.07.07 |
| [Codility Python] lesson 2 Arrays - CyclicRotation (0) | 2022.07.07 |
| [Codility Python] lesson 1 Iterations - BinaryGap (0) | 2022.07.03 |