Positive Products

CodeChefRating 1178Open on judge ↗

You are given an array $A$ of length $N$. Find the number of pairs of indices $(i,j)$ such that - $1 \leq i \lt j \leq N$ - $A_i \cdot A_j \gt 0$ ### Input - The first line contains a single integer $T$ - the number of test cases. Then the test cases follow. - The first line of each test case contains an integer $N$ - the size of the array $A$. - The second line of each test case contains $N$ spa

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