← All problemsSign in

No Odd Sum

CodeChefRating 1041Open on judge ↗

There are $N$ numbers written on a blackboard. The $i$-th number is denoted as $A_i$. The blackboard is said to be *good* if, for each pair of indices $(i, j)$ with $1 \leq i \lt j \leq N$, the sum $(A_i + A_j)$ is an even number. The blackboard might not be *good* initially, so you want to make it *good*. To do this, you can perform the following two types of operations: 1. Erase a $2$ from

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

Sign in to chat with the tutor and save your progress.

Sign in to start