Sumit and number Marble boxes!!

CodeChefOpen on judge ↗

Sumit has N numbered marble boxes numbered from 1 to N. Every day he selects two indices [L,R] and adds 1 marble to each marble box starting from L to R (both inclusive). He does this for M number of days. After M days, Sumit has a query: How many marble boxes have atleast X number marble. He has Q such queries. Input: First line contains N - number of marble boxes. Second line contains M - numb

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