题解:
枚举因子,然后计算贡献,然后容斥。
我们需要计算枚举的因子的各个倍数区间的数量和,直接像筛法一样筛。。。。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <cstdio>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define mem(i,a) memset(i,a,sizeof(i))
#define rson mid+1,r,rt<<1|1
#define lson l,mid,rt<<1
#define mp make_pair
#define pb push_back
#define ll long long
#define LL long long
using namespace std;
template <typename T>inline void read(T &_x_){
_x_=0;bool f=false;char ch=getchar();
while (ch<'0'||ch>'9') {if (ch=='-') f=!f;ch=getchar();}
while ('0'<=ch&&ch<='9') {_x_=_x_*10+ch-'0';ch=getchar();}
if(f) _x_=-_x_;
}
const double eps = 1e-8;
const int maxn = 2e5+7;
const int mod = 1e9+7;
const ll inf = 1e15;
int mu[maxn],sum[maxn],vis[maxn],p[maxn];
int t,lens,len;
void get_mu(){
memset(vis,1,sizeof(vis));
mu[1]=1;
for(int i=2;i<maxn;i++){
if(vis[i]) p[++p[0]]=i, mu[i]=-1;
for(int j=1;j<=p[0]&&i*p[j]<maxn;j++){
vis[i*p[j]]=false;
if(i%p[j]==0){ mu[i*p[j]]=0; break;}
mu[i*p[j]]=-mu[i];
}
}
}
ll fast_mod(ll m,ll n){
ll ans=1,bs=m;
while(n){
if(n&1) ans=ans*bs%mod;
bs=bs*bs%mod;
n>>=1;
}
return ans%mod;
}
int main(){
get_mu();
scanf("%d",&t);
for(int cas=1;cas<=t;cas++){
lens = 0;len = 0x7fffffff;
mem(sum,0);
int n,x;
scanf("%d",&n);
FOR(i,1,n){
scanf("%d",&x),sum[x]++;
lens = max(lens,x);
len = min(len,x);
}
for(int i=1;i<maxn;i++) sum[i]+=sum[i-1];
ll res=0;
for(int i=2;i<=len;i++){ //只枚举到最小值是因为大于最小值之后,不会有贡献
if(mu[i]==0) continue;
ll tmp=1;
for(int j=1;i*j<=lens;++j)
tmp =tmp*fast_mod(j,sum[i*j+(i-1)]-sum[i*j-1])%mod;
res = (res - mu[i] * tmp + mod) % mod;
}
printf("Case #%d: %I64d\n",cas,res);
}
return 0;
}