组合数取模模板(Pascal(到时候改C++))
function fact(x,y:longint):note;
var
k:note;
begin
if x<a[y] then
begin
fact.e:=sum[x,y];fact.f:=0;exit;
end;
fact.f:=x div a[y];k:=fact(x div a[y],y);
fact.f:=fact.f+k.f;
fact.e:=k.e*sum[x mod g[y],y] mod g[y]*mi(sum[g[y]-1,y],x div g[y],g[y]) mod g[y];
end;
function c(x,y:longint):longint;
var
i,j:longint;
k1,k2,k3:note;
begin
if x>y then exit(0);
for i:=1 to a[0] do
begin
k1:=fact(y,i);k2:=fact(x,i);
k3:=fact(y-x,i);
an[i]:=mi(a[i],k1.f-k2.f-k3.f,g[i])*k1.e
mod g[i]*ni(k2.e,g[i]) mod g[i]*ni(k3.e,g[i]) mod g[i];
end;c:=0;
for i:=1 to a[0] do
begin
j:=p div g[i];
c:=(c+j*ni(j,g[i]) mod p*an[i] mod p) mod p;
end;
end;