Bheem and Kichak

CodeChefOpen on judge ↗

Kichak and Bheem are competing for Rajkumari Indumati. Bheem needs to complete Kichak's challenge in order to win. Kichak gives an array of $N$ integers , such that it is the complete set of factors for a number $X$. **This means that if $X$ has $N$ factors then array of size $N$ would be given**. Bheem knows that Kichak is naughty so Kichak may have modified atmost 1 element in the array . Help

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