Description
一个集合
S
有
Solution
因为是恰好为
k
,可以考虑容斥原理,转化为至少为
至少为
k
的方案数很好统计,就是
然后直接容斥就好了。答案就是
∑i=kn(−1)i−k(ik)(ni)22n−i
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 1010101;
typedef long long ll;
inline char get(void) {
static char buf[100000], *S = buf, *T = buf;
if (S == T) {
T = (S = buf) + fread(buf, 1, 100000, stdin);
if (S == T) return EOF;
}
return *S++;
}
inline void read(int &x) {
static char c; x = 0;
for (c = get(); c < '0' || c > '9'; c = get());
for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
}
int n, k, ans, res;
int ph[N], fac[N], inv[N];
inline void Add(int &x, int a) {
x += a; while (x >= MOD) x -= MOD;
}
inline int Mod(int x) {
Add(x, 0); return x;
}
inline int Pow(int a, int b) {
int c = 1;
while (b) {
if (b & 1) c = (ll)c * a % MOD;
b >>= 1; a = (ll)a * a % MOD;
}
return c;
}
inline int C(int n, int m) {
return (ll)fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}
inline void Pre(int n) {
inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = (ll)inv[MOD % i] * (MOD - MOD / i) % MOD;
fac[0] = inv[0] = ph[0] = 1;
for (int i = 1; i <= n; i++) {
fac[i] = (ll)fac[i - 1] * i % MOD;
inv[i] = (ll)inv[i - 1] * inv[i] % MOD;
ph[i] = ph[i - 1] * 2 % (MOD - 1);
}
}
int main(void) {
freopen("1.in", "r", stdin);
read(n); read(k); Pre(n);
for (int i = k; i <= n; i++) {
res = (ll)C(n, i) * C(i, k) % MOD * Pow(2, ph[n - i]) % MOD;
if ((i ^ k) & 1) ans = (ans - res + MOD) % MOD;
else ans = (ans + res) % MOD;
}
cout << ans << endl;
return 0;
}