Prime Sum

CodeChefRating 1462Open on judge ↗

Given two integers $A$ and $B$. - Let $P$ denote a sequence of $N$ [prime numbers](https://en.wikipedia.org/wiki/Prime_number) such that the sum of the sequence is $A$. - Let $Q$ denote a sequence of $M$ prime numbers such that the sum of the sequence is $B$. Let $X$ denote the **maximum absolute difference** between $P_i$ and $Q_j$ among all valid pairs $(i,j)$ such that $(1 \leq i \leq N)$ and

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