那道題想到枚舉1e5以內的質因子, 但是會重複
然後隊友提醒了mobius反演, 果然還是太菜了啊
題解
首先, 題目提到任意區間滿足條件, 也就是gcd(b[1], b[2], b[3]…b[n]) >= 2 就行了, 很容易得出總的b數量爲
而其中不滿足條件的就是gcd(b[1], b[2], b[3]…b[n]) = 1的數量
我們定義
F(n)爲gcd爲n的倍數的b數量, f(n)爲gcd爲n的b數量
則有
反演得:
所以
直接求會超時, 注意到是整數除法, 讀入的時候預處理分塊用快速冪可以降低時間複雜度
然後sum-f(1)即可
code:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int N = 100010;
const ll mod = 1e9 + 7;
int mobius[N];
int prime[N];
int a[N];
bool vis[N];
int cnt;
int pre[N << 1];
int n;
inline ll min(ll a, ll b)
{
return a <= b ? a : b;
}
inline ll max(ll a, ll b)
{
return a >= b ? a : b;
}
ll fastPowMod(ll a, ll b, ll mod)
{
ll res = 1 % mod;
while(b)
{
if(b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void getMobius()
{
cnt = 0;
memset(vis, 0, sizeof vis);
memset(mobius, 0, sizeof mobius);
mobius[1] = 1;
for(int i = 2; i <= 100000; ++i)
{
if(!vis[i])
{
prime[++cnt] = i;
mobius[i] = -1;
}
for(int j = 1; j <= cnt && i * prime[j] <= 100000; ++j)
{
vis[i * prime[j]] = 1;
if(i % prime[j] == 0)
{
mobius[i * prime[j]] = 0;
break;
}
mobius[i * prime[j]] = -mobius[i];
}
}
}
int main()
{
getMobius();
int t, kas = 0;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
memset(pre, 0, sizeof pre);
ll mn = N, mx = 0;
ll a_multi = 1;
for(int i = 1; i <= n; ++i)
{
scanf("%d", a + i);
++pre[a[i]];
a_multi *= a[i];
a_multi %= mod;
mn = min(mn, a[i]);
mx = max(mx, a[i]);
}
for(int i = 1; i < (N << 1); ++i) pre[i] += pre[i - 1];//前綴和用於分塊
ll rs = 0;
for(int i = 1; i <= mn; ++i)
{
ll r = 1;
for(ll j = 1; j <= mx / i; ++j)
{
r = r * fastPowMod(j, pre[j * i + i - 1] - pre[j * i - 1], mod) % mod;//
}
r = (r * mobius[i] % mod + mod) % mod;
rs = (rs + r) % mod;
}
printf("Case #%d: %I64d\n", ++kas, ((a_multi - rs) % mod + mod) % mod);
}
return 0;
}