数列gcd【题解】

前言

BZOJ权限题

题面

对于一个长度为n的满足 <1<ai<m < 1 < a i < m <script type="math/tex" id="MathJax-Element-75"><1 $d\in[1,m]$

sol

解法与n的大小没有关系。
直接规定一下gcd，然后通过简单的组合数学搞出来，然后再用容斥减一下

code

#include<bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T&data){
    data=0;
    register char ch=0;
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch<='9'&&ch>='0'){
        data=(data<<3)+(data<<1)+(ch&15);
        ch=getchar();
    }
    return;
}
const int _ = 5e5+2;
const int mod = 998244353;
int sum[_],f[_],tong[_],n,m,k,jc[_];
inline int poww(register int a,register int b){
    register int ret=1,base=a;
    for(;b;b>>=1,base=1LL*base*base%mod)if(b&1)ret=1LL*ret*base%mod;
    return ret;
}
inline int C(register int a,register int b){
    //return 1LL*jc[a]/jc[b]*1/jc[a-b];
    return 1LL*jc[a]*poww(jc[b],mod-2)%mod*poww(jc[a-b],mod-2)%mod;
}
int main(){

    register int T;
    read(T);
    while(T--){

        read(n);read(m),read(k);
        memset(tong,0,sizeof(tong));
        memset(sum,0,sizeof(sum));
        memset(f,0,sizeof(f));
        for(register int i=1;i<=n;++i){
            register int a;read(a);
            tong[a]++;
        }

        for(register int i=1;i<=m;++i)
            for(register int j=i;j<=m;j+=i)
                sum[i]+=tong[j];
        jc[0]=1;
        //cout<<sum[1]<<' '<<sum[2]<<endl;
        for(register int i=1;i<=n;++i)jc[i]=1LL*jc[i-1]*i%mod;
        //cout<<C(3,0)<<'c'<<endl;
        for(register int i=1;i<=m;++i)
            if(n-sum[i]<=k){
                f[i]=1LL*poww((m/i),n-sum[i])*C(sum[i],k-(n-sum[i]))%mod*poww((m/i-1),k-(n-sum[i]))%mod;
                //cout<<"r"<<' '<<i<<' '<<f[i]<<' '<<C(sum[i],k-(n-sum[i]))<<endl;
            }
        for(register int i=m;i>=1;--i){
            //printf("%d ",f[i]);
            for(register int j=i+i;j<=m;j+=i)
                f[i]-=f[j],f[i]=(f[i]+mod)%mod;
            //printf("%d ",f[i]);
        }
        for(register int i=1;i<=m;++i)printf("%d ",f[i]);
        printf("\n");
    }

}
/*
1 
5 5 4
5 1 3 4 2 


 */