Chef and houses

CodeChefOpen on judge ↗

As Diwali is approaching, Chef is busy in preparing various sweets. But people in Chefland are panicking because no one is delivering the sweets to them. As chef is too busy he assigns you a task. There are $N$ houses in Town numbered $1$ $to$ $N$. And the $Kth $ house is important if $K$ is divisible by $1$ and $K$ $only$. Chef wants you to deliver sweets to important houses only. So in giv

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