Problem details from 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.
def solution(X, Y, D): if (X == Y): jumps = 0 elif Y-X % D == 0: jumps = (Y-X)/D else: jumps = ((Y-X)/D) + 1 return jumps
def solution(X, Y, D): d = Y-X jumps=d/D rem=d%D if rem != 0: jumps+=1 return jumps
I submitted the Method1 solution and received a 55% score. On the other hand, Method2 got 100%. It's not clear to me why Method2 is better than Method1. Could someone please explain?