A - OdD sUm OdD pRoDuCt

CodeChefOpen on judge ↗

You are given an array $A$ of $N$ positive integers.Find the maximum length of a subsequence of this array which has **sum** of elements and **product** of elements both odd at the same time. Note that subsequence can be empty. ###Input: - $1^{st}$ will contain $T$, the number of test cases. Then the test cases follow- - The $1^{st}$ line of each test case contains $1$ space-separated inte

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