Meena and FPD Machine

CodeChefOpen on judge ↗

There are $N$ (labeled $1$ to $N$) buildings in DBATU arranged in a straight line. Distance between buildings $i$ and $j$ is equal to |i-j|. Meena is in building $A$ and is extremely hungry. There is at max $1$ food packet in a building. Meena is so hungry that he can eat unlimited food packets. But he doesn't know in which building the food packets are. Meena has an FPD(Food Packet Detector) ma

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