Zoro AND Sanji

CodeChefOpen on judge ↗

Zoro and Sanji love challenging each other. Zoro thinks his sword skills are superior to Sanji’s kicking power but Sanji disagrees. To settle this once and for all, Zoro challenges Sanji with a problem that involves neither swords nor kicks: Zoro gives Sanji an array **A** of **N** non-negative integers. He then asks Sanji to modify the array such that the **bitwise and** (&) of all the numbers i

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