Haskell Frog Jmp
frogJmp :: Int -> Int -> Int -> Int
frogJmp x y d = ceiling (fromIntegral (y - x) / fromIntegral d :: Double)
This computes the jump count with math instead of simulation, which is the cleanest way to solve it.
frogJmp :: Int -> Int -> Int -> Int
frogJmp x y d = ceiling (fromIntegral (y - x) / fromIntegral d :: Double)
This computes the jump count with math instead of simulation, which is the cleanest way to solve it.