Break the elements

CodeChefRating 1191Open on judge ↗

Chef has an array $A$ of length $N$. In one operation, Chef can choose any element $A_i$ and split it into two **positive** integers $X$ and $Y$ such that $X+Y = A_i$. Note that the length of array increases by $1$ after every operation. Determine the **minimum** numbers of operations required by Chef to make [parity](https://en.wikipedia.org/wiki/Parity_(mathematics)) of all the elements **sam

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