【WC2014】时空穿梭（莫比乌斯反演）

题目

枚举每一维上第一个点和最后一个点的坐标差$(x_1,..x_n)$
$$\begin{array}{rl}ans& =\sum _{x_1,x_2...x_n}\left(\genfrac{}{}{0ex}{}{({\gcd }_{i=1}^n{x}_i)-1}{c-2}\right)\prod _{i=1}^n(m_i-x_i)\\ & =\sum _{d=1}^{{\min }_1^n{m}_i}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\sum _{x_1,x_2...x_n\le \frac{m_i}{d}}[\underset{i=1}{\overset{n}{\gcd }}{x}_i=1]\prod _{i=1}^n(m_i-d{x}_i)\\ & =\sum _{d=1}^{{\min }_1^n{m}_i}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\sum _{x_1,x_2...x_n\le \frac{m_i}{d}}\sum _{p|x_1,p|x_2...}\mu (p)\prod _{i=1}^n(m_i-d{x}_i)\\ & =\sum _{d=1}^{{\min }_1^n{m}_i}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\sum _{p=1}^{\frac{{\min }_1^n{m}_i}{d}}\mu (p)\sum _{x_1,x_2...x_n\le \frac{m_i}{dp}}\prod _{i=1}^n(m_i-dp{x}_i)\\ & =\sum _{d=1}^{{\min }_1^n{m}_i}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\sum _{p=1}^{\frac{{\min }_1^n{m}_i}{d}}\mu (p)\prod _{i=1}^n\sum _{1\le x_i\le \frac{m_i}{dp}}(m_i-dp{x}_i)\\ & =\sum _{d=1}^{{\min }_1^n{m}_i}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\sum _{p=1}^{\frac{{\min }_1^n{m}_i}{d}}\mu (p)\prod _{i=1}^n\frac{(2m_i-dp-dp\lfloor \frac{m_i}{dp}\rfloor )\lfloor \frac{m_i}{dp}\rfloor }{2}\\ & =\sum _{D=1}^m\prod _{i=1}^n\frac{(2m_i-D-D\lfloor \frac{m_i}{D}\rfloor )\lfloor \frac{m_i}{D}\rfloor }{2}\sum _{d|D}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\mu (\frac{D}{d})\end{array}$$

右边可以调和级数预处理，设$G(x)={\sum }_{d|x}\left(\genfrac{}{}{0ex}{}{d-1}{c-2}\right)\mu (\frac{x}{d})$。
左边的这个$\prod$我们看作一个$n$次的关于$D$的多项式，
那么因为对于$i\in [1,n]$$\frac{m_i}{D}$有$O(n\sqrt{m})$种取值，
所以一共有$O(n\sqrt{m})$种不同的多项式。
假设在某一段这个多项式是
$P(x)={\sum }_{i=0}^n{a}_i{x}^i$
那么在这一段我们需要求的就是
${\sum }_{i=l}^{r}G(i)P(i)={\sum }_{i=l}^{r}G(i){\sum }_{j=0}^n{a}_j{i}^j$
$={\sum }_{j=0}^n{a}_j{\sum }_{i=l}^{r}G(i)i^j$
因为$n$很小，所以后面那个${\sum }_{i=1}^{r}G(i)i^j$是可以直接预处理的。
至于$a_i$，暴力多项式乘法就行了，复杂度是$O(n^2)$的。你也可以写分治NTT

$\mathcal{A}CCode$

#include<bits/stdc++.h>
#define maxn 100005
#define mod 10007
#define rep(i,j,k) for(int i=(j),LIM=(k);i<=LIM;i++)
#define per(i,j,k) for(int i=(j),LIM=(k);i>=LIM;i--)
using namespace std;

int n,c,m[12],cc[maxn][22];
int fac[maxn],inv[maxn],invf[maxn],mu[maxn],G[12][22][maxn],a[maxn],vis[maxn],pr[maxn],cnt_pr;
int C(int a,int b){
	if(a < 0 || b < 0 || a-b < 0) return 0;
	return cc[a][b];
}
int ar[12];
void add(int x0,int x1){
	per(i,n,0) 
		ar[i] = (ar[i] * x0 + (i ? ar[i-1] : 0) * x1) % mod;
}

int main(){
	fac[0] = fac[1] = inv[0] = inv[1] = invf[0] = invf[1] = 1;
	mu[1] = 1;
	rep(i,cc[0][0]=1,maxn-1)
		rep(j,cc[i][0]=1,min(i,20))
			cc[i][j] = (cc[i-1][j-1] + cc[i-1][j]) % mod;
	rep(i,2,maxn-1){
		fac[i] = 1ll * fac[i-1] * i % mod;
		inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod,
		invf[i] = 1ll * inv[i] * invf[i-1] % mod;
		if(!vis[i]) pr[cnt_pr++] = i , mu[i] = -1;
		for(int j=0;pr[j] * i < maxn;j++){
			vis[i * pr[j]] = 1;
			if(i % pr[j] == 0){
				mu[i * pr[j]] = 0;
				break;
			}
			mu[i * pr[j]] = - mu[i];
		}
	}
	rep(c,2,20) rep(i,1,maxn-1)
			for(int j=i;j<maxn;j+=i)
				G[0][c][j] = (G[0][c][j] + mu[i] * C(j/i-1,c-2)) % mod;
	rep(p,1,11) rep(c,2,20) rep(i,1,maxn-1)
		G[p][c][i] = G[p-1][c][i] * i % mod;
	rep(p,0,11) rep(c,2,20) rep(i,1,maxn-1)
		G[p][c][i] = (G[p][c][i] + G[p][c][i-1]) % mod;
	int T;
	for(scanf("%d",&T);T--;){
		scanf("%d%d",&n,&c);
		int ans = 0;
		rep(i,1,n) scanf("%d",&m[i]);
		sort(m+1,m+n+1);
		for(int i=1,nxt;i<=m[1]-1;i=nxt+1){
			nxt = 0x3f3f3f3f;
			memset(ar,0,sizeof ar);
			ar[0] = 1;
			rep(j,1,n){
				nxt = min(nxt , (m[j]-1) / ((m[j]-1) / i));
				int v = (m[j]-1) / i;
			//	printf("@%d %d\n",(m[j]*v-v)%mod,(-v-v*v)%mod*inv[2]%mod);
				add((m[j]*v)%mod,(-v-v*v)%mod*inv[2]%mod);
			}
			rep(j,0,n){ 
				ans = (ans + 1ll * ar[j] * (G[j][c][nxt] - G[j][c][i-1])) % mod;
				//printf("@%d %d %d %d\n",j,ar[j],G[j][c][nxt]-G[j][c][i-1],ans);
			}
		}
		printf("%d\n",(ans+mod)%mod);
	}
}