• Say X and Y are no. of pairs for x1 and y1 in range [x2,y2] where y/x = k^n
• So all the numbers b/w x1 and y1 have pairs b/w X and Y.
• So, for range "i" => X to Y, find interval where no. of pairs are "i" using binary search.

But this is failing.This soln. looks promising to me, Please help me why this will not work. TIA

hERE'S the submission: 296696384

281319592

I have given a solution is o(n*m*5) which should ideally be accepted, but giving TLE. Can anyone please help me the flaw in this code.

TIA.