Even Differences

CodeChefOpen on judge ↗

You have an array consisting of $N$ integers $a_1, a_2... a_N$. You may perform the following operation zero or more times. - Choose any index $i$ $(1 \leq i \leq N)$ and set $a_i := a_i + 1$ Determine the minimum number of operations you have to perform so that all pairwise differences in the resulting array are even. More formally, in the resulting array it should hold that, for every $i$

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