版权声明:本文为博主原创文章,未经博主允许必须转载。 https://blog.csdn.net/qq_35950004/article/details/88293430
练习一发LaTeX
这个搁今天得整除分块后杜教筛1e10+多组数据
AC Code:
#include<bits/stdc++.h>
#define maxn 100005
#define LL long long
using namespace std;
int n,m,phi[maxn],pr[maxn/8],cnt_pr;
bool vis[maxn];
int main()
{
scanf("%d%d",&n,&m); if(n>m) swap(n,m);
phi[1] = 1;
LL ans = 1ll*n*m;
for(int i=2;i<=n;i++)
{
if(!vis[i]) pr[cnt_pr++] = i , phi[i]=i-1;
for(int j=0;pr[j]*i<=n;j++)
{
vis[pr[j] * i] = 1;
if(i % pr[j] == 0){ phi[i*pr[j]]=phi[i]*pr[j];break; }
phi[i*pr[j]] = phi[i] * phi[pr[j]];
}
ans += 1ll*(2*phi[i])*(n/i)*(m/i);
}
printf("%lld\n",ans);
}
upd:自己杠精了。
AC Code:
#include<bits/stdc++.h>
#define maxn 100005
#define LL long long
using namespace std;
int n,m,phi[maxn],pr[maxn/8],cnt_pr;
bool vis[maxn];
map<int,LL>mp;
LL solve(int now)
{
if(now <= 2137) return phi[now];
if(mp.count(now)) return mp[now];
LL &ret=mp[now]=1ll*now*(now+1)/2;
for(int i=2,nxt;i<=now;i=nxt+1)
{
int tmp = now/i;
nxt = now / tmp;
ret -= solve(tmp) * (nxt-i+1);
}
return ret;
}
int main()
{
scanf("%d%d",&n,&m); if(n>m) swap(n,m);
phi[1] = 1;
LL ans = -1ll*n*m;
for(int i=2;i<=min(n,2137);i++)
{
if(!vis[i]) pr[cnt_pr++] = i , phi[i]=i-1;
for(int j=0;pr[j]*i<=n;j++)
{
vis[pr[j] * i] = 1;
if(i % pr[j] == 0){ phi[i*pr[j]]=phi[i]*pr[j];break; }
phi[i*pr[j]] = phi[i] * (pr[j]-1);
}
phi[i] += phi[i-1];
}
for(int i=1,nxt,psolve=0,tmp,div1,div2;i<=n;i=nxt+1)
{
div1 = n / i , div2 = m / i;
nxt = min(n/div1,m/div2);
ans += 2ll * ((tmp=solve(nxt))-psolve) * div1 * div2;
psolve = tmp;
}
printf("%lld\n",ans);
}