@[Prean](/user/160839) 我觉得能（
by wkywkywky @ 2021-11-22 21:14:07
@[wkywkywky](/user/133954) 教教/se
虽然说我知道这个筛mu可以用杜教筛
by Prean @ 2021-11-22 21:18:21
@[wkywkywky](/user/133954) 我找到了一种办法，使得两个维度之和分别为n和m
可惜复杂度还是O(n)的
by Prean @ 2021-11-22 21:27:27
@[Prean](/user/160839)
$\sum\limits_{i=1}^a\sum\limits_{j=1}^b\min(\left\lfloor\dfrac{a}{i}\right\rfloor,\left\lfloor\dfrac{b}{j}\right\rfloor)$
分别计算$\left\lfloor\dfrac{a}{i}\right\rfloor$,$\left\lfloor\dfrac{b}{j}\right\rfloor$贡献即可
$O(\sqrt{a}+\sqrt{b})$
by wkywkywky @ 2021-11-22 21:30:12
@[Prean](/user/160839)
其中$a=\left\lfloor\dfrac{n}{k}\right\rfloor$,$b=\left\lfloor\dfrac{m}{k}\right\rfloor$
by wkywkywky @ 2021-11-22 21:31:29
在有锅我AFO吧
by wkywkywky @ 2021-11-22 21:32:42
@[wkywkywky](/user/133954) 后面的gcd=1（
by Prean @ 2021-11-22 21:51:11
@[Prean](/user/160839) 不是先莫反吗
by wkywkywky @ 2021-11-22 21:53:34
@[Prean](/user/160839) 我觉得没问题了
by wkywkywky @ 2021-11-22 21:59:26
@[Prean](/user/160839) 求原题/kel
by wkywkywky @ 2021-11-22 23:06:07