hey! i was wondering that is there any other way to solve such problems except using segment tree(for finding the sum in the range) and using (factorial,inverse factorial,dynamic programming , so that it could run in given time limit) , the way i did it... i saw some of the solutions of users like @kutengine and i did not understand it.. any help there.... thanks in advance.
↧