bzoj 4173: 数学 欧拉函数

题意

$n,m<=10 ^{15}$

分析

大佬们好强啊%%%

$n\mod k+m\mod k>=k可以变形成\lfloor\frac{n+m}{k}\rfloor-\lfloor\frac{n}{k}\rfloor-\lfloor\frac{m}{k}\rfloor=1$

$ans=\sum_{k=1}^{n+m}\phi(k)*\lfloor\frac{n+m}{k}\rfloor-\sum_{k=1}^{n}\phi(k)*\lfloor\frac{n}{k}\rfloor-\sum_{k=1}^{m}\phi(k)*\lfloor\frac{m}{k}\rfloor$

$那么\sum_{k=1}^{n}\phi(k)*\lfloor\frac{n}{k}\rfloor又等于什么呢？$

$\sum_{k=1}^{n}k=\sum_{k=1}^n\sum_{i|k}\phi(i)=\sum_{k=1}^n\phi(k)*\lfloor\frac{n}{k}\rfloor$

$那么可以得到ans=\phi(n)*\phi(m)*n*m$

请收下蒟蒻的膝盖%%%

代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define LL long long
using namespace std;

const LL MOD=998244353;

LL get_phi(LL n)
{
    LL ans=n,w=sqrt(n);
    for (LL i=2;i<=w;i++)
        if (n%i==0)
        {
            ans=ans/i*(i-1);
            while (n%i==0) n/=i;
        }
    if (n>1) ans=ans/n*(n-1);
    return ans%MOD;
}

int main()
{
    LL n,m;
    scanf("%lld%lld",&n,&m);
    printf("%lld",(LL)get_phi(n)*get_phi(m)%MOD*(n%MOD)%MOD*(m%MOD)%MOD);
    return 0;
}