Breaking Door

CodeChefOpen on judge ↗

Daya from CID wants to break n consecutive doors.He will break only 2 doors or 1 door in a single kick. ACP's condition is that number of kicks must be a multiple of k . Find minimal number of kicks so Daya can break all gates that satisfies ACP's condition? print -1 if not possible. INPUT - First line of input contains two integer n and k . OUTPUT - Output a single integer denoting the ans

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