Virat and Numbers

CodeChefOpen on judge ↗

Virat and his teammates were playing a game . The game as as follows : The teammates gave Virat a problem consisting of n integers of various values . Virat had to find a subset of the given array whose product ( all numbers multiplied together ) would give the minimum value possible . Being a topper in school Virat asks for your help !! Help Virat !! Input First will contain an integer n .

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