← All problemsSign in

Superincreasing

CodeChefRating 1201Open on judge ↗

An array $A$ of length $N$ containing **positive** integers is said to be *superincreasing* if each element is **strictly greater** than the sum of all the previous elements. That is, for each $i$ from $2$ to $N$, the condition $$ A_i \gt A_1 + A_2 + \ldots + A_{i-1} $$ should hold. For example, $A = [3, 5, 10, 42]$ is a superincreasing array, while $A = [1, 2, 3]$ is not ($3 = 1+2$, but it sho

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