HDU 4675 GCD of Sequence(数论+莫比乌斯反演)

Alice is playing a game with Bob.
Alice shows N integers a 1, a 2, …, a N, and M, K. She says each integers 1 ≤ a i ≤ M.
And now Alice wants to ask for each d = 1 to M, how many different sequences b 1, b 2, …, b N. which satisfies :
1. For each i = 1…N, 1 ≤ b[i] ≤ M
2. gcd(b 1, b 2, …, b N) = d
3. There will be exactly K position i that ai != bi (1 ≤ i ≤ n)

Alice thinks that the answer will be too large. In order not to annoy Bob, she only wants to know the answer modulo 1000000007.Bob can not solve the problem. Now he asks you for HELP!
Notes: gcd(x 1, x 2, …, x n) is the greatest common divisor of x 1, x 2, …, x n

Input

The input contains several test cases, terminated by EOF.
The first line of each test contains three integers N, M, K. (1 ≤ N, M ≤ 300000, 1 ≤ K ≤ N)
The second line contains N integers: a 1, a 2, ..., a n (1 ≤ a i ≤ M) which is original sequence.
 

Output

For each test contains 1 lines :
The line contains M integer, the i-th integer is the answer shows above when d is the i-th number.

Sample Input

3 3 3
3 3 3
3 5 3
1 2 3

Sample Output

7 1 0
59 3 0 1 1

        
  

Hint

In the first test case :
when d = 1, {b} can be :
(1, 1, 1)
(1, 1, 2)
(1, 2, 1)
(1, 2, 2)
(2, 1, 1)
(2, 1, 2)
(2, 2, 1)
when d = 2, {b} can be :
(2, 2, 2)
And because {b} must have exactly K number(s) different from {a}, so {b} can't be (3, 3, 3), so Answer = 0

        
 

#include<iostream>
#include<bitset>
#include<cstdio>
#include<cstring>
using namespace std;
#define ll long long
#define MAXN 300010
#define maxn 300001
#define mod 1000000007
ll fact[MAXN],inv[MAXN],prime[MAXN],mu[MAXN],num[MAXN],ans[MAXN],F[MAXN],m;
bitset<MAXN>v;
ll power(ll a, ll b,ll p)
{
    ll ans =1%p;
    for(; b; b>>=1)
    {
        if(b&1)
            ans=ans*a%p;
        a=a*a%p;
    }
    return ans;
}
void Init()
{
    mu[1]=1,m=0;
    for(int i=2; i<=MAXN; i++)
    {
        if(!v[i])
        {
            prime[++m]=i;
            mu[i]=-1;
        }
        for(int j=1; j<=m&&i*prime[j]<=MAXN; j++)
        {
            v[i*prime[j]]=true;
            if(i%prime[j])
                mu[i*prime[j]]=-mu[i];
            else
            {
                mu[i*prime[j]]=0;
                break;
            }
        }
    }
    fact[0] = inv[0] = 1;
    for (int i = 1; i <= 300005; i++)
    {
        fact[i] = fact[i - 1] * i%mod;
        inv[i] = power(fact[i], mod - 2,mod)%mod;
    }
}
int main()
{
    Init();
    ll N,M,K,x;
    while(scanf("%lld%lld%lld",&N,&M,&K)!=EOF)
    {
        memset(num,0,sizeof(num));
        for(int i=1; i<=N; i++)
        {
            scanf("%lld",&x);
            num[x]++;
        }
        for(int i=1; i<=M; i++)
        {
            for(int j=i+i; j<=M; j+=i)
                num[i]+=num[j];
        }
        for (int i = 1; i <=M; i++)
        {
            if (num[i] < N - K)
            {
                F[i] = 0;
                continue;
            }
            F[i] = (fact[num[i]] % mod * inv[N - K] % mod*inv[K + num[i] - N] % mod*power(M / i - 1, num[i] + K - N,mod) % mod*power(M / i, N- num[i],mod) % mod)%mod;
        }
        for (int i = 1; i <= M; i++)
        {
            ans[i]=0;
            for (int j = i; j <= M; j += i)
                ans[i] = ((ans[i] + mu[j / i] * F[j] + mod) % mod) % mod;
        }
        for(int i=1; i<=M; i++)
        {
            printf("%lld",ans[i]);
            if(i!=M)
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}