zoj 3868 GCD Expectation（容斥原理）

Edward has a set of n integers {a₁, a₂,...,a_n}. He randomly picks a nonempty subset {x₁, x₂,…,x_m} (each nonempty subset has equal probability to be picked), and would like to know the expectation of [gcd(x₁, x₂,…,x_m)]^k. 

Note that gcd(x₁, x₂,…,x_m) is the greatest common divisor of {x₁, x₂,…,x_m}.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains two integers n, k (1 ≤ n, k ≤ 10⁶). The second line contains n integers a₁, a₂,…,a_n (1 ≤ a_i ≤ 10⁶).

The sum of values max{a_i} for all the test cases does not exceed 2000000.

Output

For each case, if the expectation is E, output a single integer denotes E · (2ⁿ - 1) modulo 998244353.

Sample Input

1
5 1
1 2 3 4 5

Sample Output

42

Edward has a set of n integers {a₁, a₂,...,a_n}. He randomly picks a nonempty subset {x₁, x₂,…,x_m} (each nonempty subset has equal probability to be picked), and would like to know the expectation of [gcd(x₁, x₂,…,x_m)]^k.

Note that gcd(x₁, x₂,…,x_m) is the greatest common divisor of {x₁, x₂,…,x_m}.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains two integers n, k (1 ≤ n, k ≤ 10⁶). The second line contains n integers a₁, a₂,…,a_n (1 ≤ a_i ≤ 10⁶).

The sum of values max{a_i} for all the test cases does not exceed 2000000.

Output

For each case, if the expectation is E, output a single integer denotes E · (2ⁿ - 1) modulo 998244353. （(2ⁿ - 1) 其实不用考虑了）

Sample Input

1
5 1
1 2 3 4 5

Sample Output

42

这题一不小心就要超时了。。。

#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#include<cmath>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#include <ctime>
#include <cstdlib> 
#define ll long long
#define mod 998244353
using namespace std; 
int num[1000001];    //把这两个数组放到main函数里就超时了。。 
int r[1000001];  
ll power(ll a, ll n) {
  ll r = 1;
  for (; n; n >>= 1) {
    if (n & 1) r = r * a % mod;
    a = a * a % mod;
  }
  return r;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		memset(r,0,sizeof(r)); //我把r换成map居然超时了。。
		int n,m,a;
		scanf("%d%d",&n,&m);
		int max=0;
		for(int i=0;i<n;++i){
			scanf("%d",&a);
			r[a]++;
			if(a>max)
				max=a;
		}
		for(int i=max;i>=1;--i){ //枚举gcd的可能值(倒序)
			int sum=0;
			num[i]=0;
			for(int j=i;j<=max;j+=i){ //求它的倍数 
				sum+=r[j]; //符合条件的元素个数 
				num[i]=(num[i]-num[j]+mod)%mod; //我们求的只有gcd=i而不包括它的倍数 
			}
			num[i]=(num[i]+power(2,sum)-1)%mod; //power(2,sum)-1求长度为sum的非空子集个数 
		}
		int s=0;
		for(int i=1;i<=max;++i){ //gcd
			s=(s+power(i,m)*num[i]%mod)%mod; 
		}
		printf("%d\n",s);
	}
	return 0;
}