Positive Product

CodeChefOpen on judge ↗

Given an array a consisting of n integers, you have to remove exactly one integer such that product of remaining integers is positive. Note: Zero is neither positive nor negative. Input - First line contains number of integers, n. - Second line contains n integers of array a. Output - Print possible if you can get positive product by removing exactly one integer else print impossible.

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