Angry Cyborg
Cyborg Jenish is angry. He has so much rage that he decided to go on a demolition spree for $Q$ days. There are $N$ cities in his world numbered $1$ to $N$, in a row from left to right. That is the $i^{th}$ city from left side is city-$i$ where $1 \leq i \leq N$. The supreme leader of the world is VSM and there are infinite statues of VSM in each city. On each day Jenish chooses two cities $L$
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.
Sign in to chat with the tutor and save your progress.
Sign in to start