hi cf community Spoiler alert for someone who hasn't solve the problem!!!!!!
i was solving this problem https://mirror.codeforces.com/contest/13/problem/E using sqrt decomposition and got tle the first time then i just increased the sqrt by one and got accepted but i know for a fact that by increasing the sqrt some operations has to take longer time so is it a known method to increase the sqrt or that was just luck?
find s such as $$$(n / s * constant + s * constant) * q$$$ min
answer query take longer so I put 444 instead of 318
and you do this in all sqrt problems??
yes why not