← All problemsSign in

Sibasish and Problems

Sibasish has been performing poorly in recent contests. You can check his rating graph here. The graph seems to go down much quicker than it goes up :(. So in an attempt to improve himself, he decides to solve $n$ questions numbered $1$ through $n$. But there are too many questions and so he cannot solve them in a single day. He chooses a positive integer $k ( 4 -> 4 -> 3 -> 3 -> 2 -> 2 -> 1 -> 1

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