← All problemsSign in

Prime Prefixes

CodeChefRating 2178Open on judge ↗

For any array $B$ of length $M$, define: - The prefix sum $S_i = \sum_{j=1}^{i} B_j$ for $1 \le i \le M$. - The value $f(B)$ as the number of indices $i$ such that $S_i$ is a **prime** number. --- You are given an array $A$ of length $N$, consisting only of the numbers $1$ and $2$. Let $M$ denote the maximum value of $f(B)$ among all arrays $B$ that can be obtained by **reordering** the element

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