Hi all ,

Could anybody please help me in debugging this 36180668 . It is not printing anything after sort function is called . Thanks in advance .

In 1-D we can find sum in range [l, r] using sum[r] - sum[l - 1].

In 2-D we can find sum in range from (x1, y1) to (x2, y2) using sum[x2][y2] - sum[x2][y1] - sum[x1][y2] + sum[x1][y1] where sum[] or sum[][] is cumulative sum .

How to find sum in range from (x1, y1, z1) to (x2, y2, z2) in a similar way ?

Could anyone please tell me how to solve Problem E . I have seen some codes which use a segment tree but i am not able to understand. Also there is no editorial for this round .Any help would be appreciated. Thanks in advance.

Hello everyone ! I am trying to solve this problem.I didn't understand the editorial properly. Please help me to understand the binary raise used in the editorial. Because i am new to this concept, provide me some tutorial to learn it.Thanks :)