题意
令 f(i) 为i的不同质因子的个数,求 ∑2f(i)[1<=i<=n]
思路
如果
i=pc11pc22...pcf(i)f(i)
,则满足
PQ=i,gcd(P,Q)=1
的
(P,Q)
有序对的个数为
2f(i)
,因为每个
pckk
要么属于
P
,要么属于
∑[1<=P,Q<=n][1<=PQ<=n][gcd(P,Q)=1]
而
[1<=P,Q<=n]=[1<=P<Q<=n]+[1<=Q<P<=n]+[1<=P=Q<=n]
所以
∑[1<=P,Q<=n][1<=PQ<=n][gcd(P,Q)=1]=1+2∑[1<=P<Q<=n][1<=PQ<=n][gcd(P,Q)=1]
记它为S。
枚举 1<=P<n−−√ ,则 P<Q<=nP ,则
S=∑[1<=P<n−−√]∑[P<Q<=np][gcd(P,Q)=1]
=∑[1<=P<n−−√](∑[1<=Q<=np][gcd(P,Q)=1]−∑[1<=Q<=P][gcd(P,Q)=1])
,所以问题就是要求1~n与P互质的数的个数。
假设 P 的质因子集合为
代码
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "local.h"
#endif // LOCAL
typedef long long ll;
const ll mod = 1e9 + 7;
const ll N = 1e6 + 7;
vector<ll> prime, fac[N];
ll minfac[N], phi[N];
bool used[N];
void init() {
phi[1] = 1;
for (ll i = 2; i < N; i++) {
if (!used[i]) {
minfac[i] = i;
phi[i] = i - 1;
prime.push_back(i);
}
for (ll j = 0; j < prime.size(); j++) {
if (prime[j] * i >= N) break;
used[prime[j] * i] = 1;
minfac[prime[j] * i] = prime[j];
if (i % prime[j] == 0) {
phi[prime[j] * i] = prime[j] * phi[i];
break;
}
else {
phi[prime[j] * i] = (prime[j] - 1) * phi[i];
}
}
}
for (ll i = 2; i < N; i++) {
ll x = i;
while (x > 1) {
ll buf = minfac[x];
fac[i].push_back(buf);
while (x % buf == 0) x /= buf;
}
}
}
inline ll lowbit(ll x) {
return x & -x;
}
ll Log2[N];
ll calc(vector<ll> &fac, ll n) {
ll ans = n, sz = fac.size();
ll mul[1 << sz] = {1};
for (ll i = 1; i < (1 << sz); i++) {
ll lb = lowbit(i);
mul[i] = mul[i - lb] * -fac[Log2[lb]];
ans = (ans + n / mul[i] + mod * mod) % mod;
}
return ans;
}
ll solve(ll n) {
for (ll i = 0; (1 << i) < N; i++) {
Log2[1 << i] = i;
}
ll ans = 0;
for (ll p = 1; p * p < n; p++) {
ans = (ans + calc(fac[p], n / p) - phi[p] + mod) % mod;
}
return (ans * 2 + 1) % mod;
}
int _, cas;
ll n;
int main() {
init();
cin >> _;
while (_--) {
printf("Case #%d: ", ++cas);
cin >> n;
cout << solve(n) << endl;
}
return 0;
}