Codility Lesson3 - FrogJmp

Codility Lesson3 - FrogJmp

https://app.codility.com/demo/results/trainingXYNX55-NT5/

Test results - Codility

 

문제

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:

def solution(X, Y, 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.

For example, given:

X = 10 Y = 85 D = 30

the function should return 3, because the frog will be positioned as follows:

• after the first jump, at position 10 + 30 = 40
• after the second jump, at position 10 + 30 + 30 = 70
• after the third jump, at position 10 + 30 + 30 + 30 = 100

Write an efficient algorithm for the following assumptions:

• X, Y and D are integers within the range [1..1,000,000,000];
• X ≤ Y.

 

정답

def solution(X, Y, D):
    n= int((Y-X)/D)
    
    return n+1

 

결과

-> 수가 딱 나눠떨어지는 길이를 고려 안함

---

정답-Retry

def solution(X, Y, D):
    n= int((Y-X)/D)
    re = int((Y-X)%D)

    if re==0:
        result=n
    else:
        result = n+1
   
    return result

 

결과-Retry