2019南昌网络赛 D. Interesting Series（分治FFT）

题目链接
可以推出$F(n)=\frac{a^n-1}{a-1}$
对于查询k，需要求${\sum }_{t\subseteq s}{a}^{sum(t_i)}$,其中t是s的包含k个元素的子集。
写出生成函数：
$f(x)={\prod }_{i=1}^n(a^{s_i}x+1)$
用分治fft求出这个多项式，其中$x^k$的系数就是${\sum }_{t\subseteq s}{a}^{sum(t_i)}(|t|=k)$
（喜提模板一套

#include<bits/stdc++.h>
#define C complex<double>
#define ll long long
using namespace std;
const double pi = acos(-1);
const int maxn = 1e5 + 50;
const ll mod = 100003;
ll qm(ll a, ll b){ll res = 1; while(b){if(b&1) res = res*a%mod; a = a*a%mod; b >>= 1; } return res; }
struct FFT {
	int n, m, rev[maxn << 2];
	C a[maxn << 2], b[maxn << 2];
	void init(int len) {
		for (n = 1, m = 0; n <= len; n <<= 1, m++);
		for (int i = 0; i < n; ++i) {
			rev[i] = rev[i >> 1] >> 1 | (i & 1) << (m - 1);
			a[i] = C(0, 0);
			b[i] = C(0, 0);
		}
	}
	void fft(C *a, int f) {
		for (int i = 0; i < n; ++i)if (i < rev[i])swap(a[i], a[rev[i]]);
		for (int i = 1; i < n; i <<= 1) {
			double alpha = pi / i;
			if (f == -1)alpha = -pi / i;
			for (int k = 0; k < i; ++k) {
				C w = exp(C(0, alpha * k));
				for (int j = k; j < n; j += (i << 1)) {
					C x = w * a[j + i];
					a[j + i] = a[j] - x;
					a[j] += x;
				}
			}
		}
		return;
	}
	void Calculate() {
		fft(a, 1); fft(b, 1);
		for (int i = 0; i < n; ++i)a[i] *= b[i];
		fft(a, -1);
	}
} F;
int n, a, q;
ll p[maxn], inv[maxn];
ll s[maxn];
void init()
{
    cin>>n>>a>>q;
    for(int i = 1; i <= n; ++i) {
        scanf("%lld", &s[i]);
        s[i] = qm(a, s[i]);
    }
}
vector<ll> w[maxn<<2];
void sol(int rt, int l, int r){
    if(l == r){
        w[rt].push_back(1); w[rt].push_back(s[l]); return;
    }
    int mid = (l+r)>>1;
    sol(rt<<1, l, mid); sol(rt<<1|1, mid+1, r);
    F.init(r-l+1);
    for(int i = 0; i <= mid-l+1; ++i) F.a[i] = C(w[rt<<1][i], 0);
    for(int i = 0; i <= r-mid; ++i) F.b[i] = C(w[rt<<1|1][i], 0);
    F.Calculate();
    for(int i = 0; i <= r-l+1; ++i){
        ll val = (F.a[i].real()/F.n + 0.5);
        w[rt].push_back(val%mod);
    }
}
ll Com(int n, int m){
    ll ans = p[n]*inv[m]%mod*inv[n-m]%mod;
    return ans;
}
int main(){
    p[0] = inv[0] = 1;
    for(int i = 1; i < maxn; ++i) p[i] = p[i-1]*i%mod, inv[i] = qm(p[i], mod-2);
    init();
    sol(1, 1, n);
    ll pre = qm(a-1+mod, mod-2);//1/(a-1)
    while(q--){
        int k; scanf("%d", &k);
        ll ans = pre * (w[1][k] - Com(n, k) + mod)%mod;
        ans = (ans + mod)%mod;
        printf("%lld\n", ans);
    }
}