YE DOORIYAN

CodeChefOpen on judge ↗

One day Chef decided to visit his friend. It turned out that the Chef's house is located at point 0 and his friend's house is located at point x(x > 0) of the coordinate line. In one step the Chef can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house. ###Input: - First line will contain $T$, number

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