1
2
3
4
ll inv[maxn];
inv[1
rep(i,2
inv[i] = inv[mod%i] * (mod-mod/i) % mod;

1
2
3
4
ll f[maxn];
ll f[1
rep(i,2
f[i] = f[i-1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
ll cur,p[maxn],q[maxn],inv[maxn];
ll C
return
}
ll c
if
if
return
}
void
p[0
for
inv[i] = (mod-mod/i)*inv[mod%i]%mod;
q[i] = q[i-1
p[i] = p[i-1
}
}
//在每次的时候就得cur初始化为1

1
2
3
int
return
}