← All problemsSign in

Game (Easy)

CodeChefRating 1760Open on judge ↗

**This is the easy version of the problem. Both versions are worth the usual $100$ points. In this version, the major difference is $N \le 2000$.** You are playing a game on yet another array $A$ of size $N$. You have $K$ coins at the start, and will do the following action: - You start with $sum = 0, x = 0$. - For each $i = 1, 2, \ldots, N$ (in this order), choose to do exactly one of the foll

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