看的题解 写了下
数论思维好题
附上题解
https://async.icpc-camp.org/d/621-2016
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int maxn=1e6+10;
ll n,cnt=0;
ll phi[maxn],prime[maxn];
ll p[maxn][12],vis[maxn];
ll quick_mod(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1) ans=ans*a%mod;
b>>=1;
a=a*a%mod;
}
return ans;
}
void init()
{
cnt=0;
memset(phi,0,sizeof(phi));
memset(p,0,sizeof(p));
memset(vis,0,sizeof(vis));
phi[1]=1;
for(int i=2;i<maxn;i++) if(!phi[i])
{
prime[cnt++]=i;
for(int j=i;j<maxn;j+=i)
{
p[j][vis[j]++]=i;
if(!phi[j]) phi[j]=j;
phi[j]-=phi[j]/i;
}
}
}
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
ll dfs(int idx,ll y,int cnt,int x)
{
ll ret=0;
for(int i=idx;i<cnt;i++) ret+=y/p[x][i]-dfs(i+1,y/p[x][i],cnt,x);
return ret;
}
ll solve(ll x,ll y)
{
if(x==1) return y;
ll ans=0;
ans=dfs(0,y,vis[x],x);
return (y-ans)%mod;
}
int main()
{
init();
int t;
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
scanf("%lld",&n);
ll ans=0;
for(ll j=1;j*j<=n;j++)
{
ans=(ans+solve(j,n/j)-phi[j]+mod)%mod;
}
printf("Case #%d: %lld\n",i,(2*ans+1)%mod);
}
return 0;
}