← All problemsSign in

Half Sequence

CodeChefRating 2543Open on judge ↗

### Read problems statements in [Russian](https://www.codechef.com/download/translated/COOK133/russian/HFSEQ.pdf). Chef has an array $A$ of size $N$. Chef wants to choose any subsequence of size **exactly** $ \lceil \frac{N}{2} \rceil$ from the array such that GCD of all the elements in that sequence must be $2$. Chef names such a kind of sequence as a *half-sequence*. Help Chef to find wheth

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