hippopotamus

CodeChefOpen on judge ↗

An hippo decided to visit his wife. It turned out that the hippo's house is located at point 0 and his wife's house is located at point x of the coordinate line. In one step the hippo can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps hippo need to make in order to get to his wifi's house. ###Input The first line of the input contains an integer x (1 ≤ x

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI