51nod1223 分数等式的数量

51nod1223 分数等式的数量

Time Limit：6 秒 Memory Limit：128GB
Description
有这样一个分数等式：$\frac1X + \frac1Y = \frac1N$，(X,Y,N > 0)。给出L，求有多少满足X < Y <= L的等式。
例如：L = 12，满足条件的等式有3个，分别是：$\frac13 + \frac16 = \frac12, \frac14 + \frac1{12} = \frac13, \frac16 + \frac1{12} = \frac14$。
Input
输入1个数L(1 <= L <= 10^11)
Output
输出符合条件的等式的数量。
Sample Input
12
Sample Output
3

---

解题思路

$\because \frac1x+\frac1y=\frac{x+y}{xy}\therefore 如果\frac1x+\frac1y=\frac1n，那么x+y|xy$
令$d=\gcd(x,y),x=dx',y=dy'$，则$dx'+dy'|x'y'd^2\to x'+y'|x'y'd$
$\because \gcd(x',y')=1 \therefore x'+y'|d$
因此

$$\begin{align} Ans & =\sum_{X=1}^L\sum_{Y=X+1}^L[X+Y|XY] \\ & =\sum_{x'=1}^L\sum_{y'=x'+1}^L[gcd(x',y')=1]\sum_{x'+y'|d,y'd<=L} 1\\ & =\sum_{x'=1}^L\sum_{y'=x'+1}^L\lfloor\frac{\frac L{y'}}{x'+y'}\rfloor[gcd(x',y')=1] \\ & =\sum_{x=1}^L\sum_{y=x+1}^L\lfloor\frac{\frac Ly}{x+y}\rfloor \sum_{k|\gcd(x,y)}\mu(k) \\ & =\sum_{k=1}^L\mu(k)\sum_{y=1}^{\frac Lk}\sum_{x=1}^{y-1}\lfloor\frac{\frac L{ky}}{kx+ky}\rfloor \\ & =\sum_{k=1}^{\sqrt L}\mu(k)\sum_{y=1}^{\frac{\sqrt L}k}\sum_{T=y+1}^{2Y-1}\lfloor\frac{\frac L{k^2y}}T\rfloor \\ & (用T代替x+y，k^2>L则\lfloor\frac{\frac L{k^2y}}T\rfloor=0，(x+y)y>y^2>\sqrt{\frac L{k^2}}同样值为0)\\ \end{align}$$

最后一个下取整求和分块处理好了。

---

时间复杂度？

$$\begin{align} O(\sum_{k=1}^{\sqrt L}\sum_{y=1}^{\frac{\sqrt L}k}\sqrt{\frac L{k^2y}}) & =O(\sum_{k=1}^{\sqrt L}\frac 1k\sum_{y=1}^{\frac{\sqrt L}k}\sqrt{\frac Ly})\\ & =O(\sum_{k=1}^{\sqrt L}\frac 1k\sum_{x=1}^{\sqrt{\frac{\sqrt L}k}}\frac{\sqrt L}x((x+1)^2-x^2))\\ & =O(\sum_{k=1}^{\sqrt L}\frac 1k\sum_{x=1}^{\sqrt{\frac{\sqrt L}k}}\sqrt L)\\ & =O(\sum_{k=1}^{\sqrt L}(\frac{\sqrt L}k)^{\frac 32})\\ & <O(\sum_{k=1}^{\sqrt L}\frac{L^{\frac 34}}k)\\ & =O(L^{\frac 34}\log \sqrt{L}) \end{align}$$

交上去很小很小就是了。

#include<cstring>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define N 1001001

using namespace std;

typedef long long ll;

ll L,mu[N],pr[N];
bool bz[N];

ll sum(ll n,ll h,ll t){
    ll ans=0;
    for(ll i=h,j;i<=n && i<=t;i=j+1){
        j=min(t,n/(n/i));ans=ans+(n/i)*(j-i+1);
    }return ans;
}

int main(){
    scanf("%lld",&L);
    mu[1]=1;
    for(ll i=2;i<N;i++){
        if(!bz[i])mu[pr[++pr[0]]=i]=-1;
        for(int j=1;j<=pr[0] && i*pr[j]<N;j++){
            bz[i*pr[j]]=1;mu[i*pr[j]]=-mu[i];
            if(i%pr[j]==0){mu[i*pr[j]]=0;break;}
        }
    }
    ll ans=0;
    for(ll k=1;k*k<=L;k++)if(mu[k])
        for(ll Y=1;Y*Y*k*k<=L;Y++)ans=ans+mu[k]*sum(L/Y/k/k,Y+1,Y+Y-1);
    printf("%lld",ans);
}