← All problemsSign in

Speedrunning (Easy)

CodeChefRating 2766Open on judge ↗

**This is the easy version of the problem. The only difference between the versions are the constraints. Here $\sum N \le 4000$ and $Q = 1$. Each version is worth $40$ points.** You're playing a game which consists of $N$ levels, and you have an integer parameter $X$. You initially start the game with 0 armour points. At the start of the $i$-th level, you may perform each of the following actio

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