in d, i just found the best ans possible for each i,j,k powers of 2 possible

"there will be atmost logA elements in the stack" ... i wish i could have figured this out ,,,i was stuck trying to figure out a magical logarithmic way

i never thought that i can use segment trees for gcd also ,,, thought for hours for a way to quickly calculate gcd without scanning numbers lol

its a dialogue from avengers infinity war in short form,,

how did we thought of n-x < 25 ?? ,, like is it a standard thing ,if not how did people who solved it came up with this idea