Steve and Gun

CodeChefOpen on judge ↗

Steve is in a fight with Hydra. He has $n$ gun shots. He has to kill the enemy in order to rule their territory. But, he can only fire $1$ or $2$ shots at each move. He also wants the number of moves to be a multiple of an integer $k$ otherwise the gun will explode. Help Steve to find the minimal number of moves to win the battle against Hydra by following the conditions given. Input: - Firs

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