Consider N boxes numbered 1 to N. Each box can house any number of chocolates. And initially all the boxes are empty.
There are two types of queries that can be posed by the throwers.
a. 0 l r -> Add chocolates to the boxes between the index l and r (inclusive) such that l'th box get 1 chocolate, (l+1)the box gets 2 chocolates ... r'th box gets (r-l+1) chocolate(s)
b. 1 l r -> Count the number of chocolates that are currently in the boxes between l and r (inclusive)
Can anyone provide some hints?
