已解决……忘了特判`l==1`。。。。。。
顺便[喜提最优解](https://www.luogu.com.cn/record/77974856)
by Static_int @ 2022-06-27 12:37:26
cjld,别卷了
by TernaryTree @ 2022-06-27 12:46:37
另外请问您这是整除分块吗？
有点没看懂
by Missa @ 2022-06-27 12:51:39
@[Missa](/user/443664) 转化为曲线下整点数量再用stern-brocot tree二分和皮克定理计算
by Static_int @ 2022-06-27 12:53:08
复杂度 $O(\sqrt[3]n\log n)$
by Static_int @ 2022-06-27 12:54:40
建议投个题解（
by OldVagrant @ 2022-06-27 13:37:22
@[z_z_y](/user/438168) SP201啥来着有了，我用那题的算法做的
by Static_int @ 2022-06-29 11:19:40