Chef and Numbers

CodeChefOpen on judge ↗

Chef challenged his friend today. He has given an array A containing N integers. His task is to update all elements of an array to some minimum value x, that is, A[i]=x; 1≤i≤N such that product of all elements of this new array is strictly greater than the product of all elements of the initial array. Note that x should be as minimum as possible such that it meets the given condition. Help him fin

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