Even tuples
You are given an array $A$ consisting of $N$ integers and $Q$ queries. Each query is described by two integers $L$ and $R$. For each query, output the number of tuples $(i, j, k)$ such that $L\le i\lt j\lt k\le R$ and $A_i+A_j+A_k$ is an even number. ### Input - The first line contains an integer $T$, the number of test cases. Then the test cases follow. - The first line of each test case contain
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.
Sign in to chat with the tutor and save your progress.
Sign in to start