参考watashi神的代码写的。。。
找出n的质因数,然后剔除所有质因数的整倍数,这样的数肯定和n有公共因子的非互质的。。。
然后就是容斥原理了。。
代码如下:
vector<int>Prime;
LL mypow(int x)
{
LL _x = (LL)x;
return (_x*_x%mod)*(_x*_x%mod)%mod;
}
void divide(int x)
{
Prime.clear();
for(int i = 2; i*i <= x; ++i)
{
if(x%i==0) Prime.push_back(i);
while(x%i==0) x/=i;
}
if(x>1) Prime.push_back(x);
}
LL gcd(LL a, LL b)
{
return b==0?a:gcd(b,a%b);
}
LL sum(int x)
{
LL _x = (LL)x;
LL a[] = {_x, _x+1, 2*_x+1, 3*_x*_x+3*_x-1};
LL b = 30;
LL ans = 1;
for(int i = 0; i < 4; ++i)
{
LL g = gcd(a[i], b);
a[i]/=g;
b/=g;
ans = a[i]%mod*ans%mod;
}
return ans;
}
LL IEP(int n, int m, int f)
{
if(n==0) return 0;
if(m==0) return f*sum(n);
return (IEP(n, m-1, f)+IEP(n/Prime[m-1], m-1, -f)*mypow(Prime[m-1])%mod+mod)%mod;
}
int main ()
{
int t, n;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
divide(n);
printf("%lld\n", IEP(n, (int)Prime.size(), 1));
}
return 0;
}