IEEE Sequence

CodeChefOpen on judge ↗

Raghavan and Varada are playing a sequence game. Varada gives the first $N$ numbers of the sequence to Raghavan. He then tells him that every subsequent number is defined as follows : $a[j]$ = count of $i$ such that $0 \leq i < j$ and $a[i] \geq j - i$. Varada then queries $Q$ indices. Can you help Raghavan figure the number for each query index? It is given that the first $n$ numbers a

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