SDOI竟有如此水题!
这不是一眼题么,先从n个数中选出m个其他的数错位排列统计一下就搞定了
错位排列公式:
f
[
1
]
=
0
,
f
[
2
]
=
1
f[1]=0,f[2]=1
f[1]=0,f[2]=1
f
[
i
]
=
(
i
−
1
)
∗
(
f
[
i
−
1
]
+
f
[
i
−
2
]
)
f[i]=(i-1)*(f[i-1]+f[i-2])
f[i]=(i−1)∗(f[i−1]+f[i−2])
然后组合数用阶乘+逆元搞
然后你会发现样例第2组数据特别坑,我每次都输出0,然后你特判 f a c [ 0 ] = i n v [ 0 ] = p r o d [ 0 ] = f [ 0 ] = 1 fac[0]=inv[0]=prod[0]=f[0]=1 fac[0]=inv[0]=prod[0]=f[0]=1 就过了
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 1000010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
ll fac[N], inv[N], prod[N], cw[N] ;
int T ;
void init(int n) {
fac[0] = inv[0] = prod[0] = 1 ;
fac[1] = inv[1] = prod[1] = 1 ;
rep(i, 2, n) {
fac[i] = fac[i - 1] * i % MOD ;
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD ;
prod[i] = prod[i - 1] * inv[i] % MOD ;
}
cw[0] = 1, cw[1] = 0, cw[2] = 1 ;
rep(i, 3, n) cw[i] = (i - 1) * (cw[i - 1] + cw[i - 2]) % MOD ;
}
ll C(ll a, ll b) {
return fac[a] * prod[b] % MOD * prod[a - b] % MOD ;
}
signed main(){
scanf("%d", &T) ;
init(1000000) ;
while (T--) {
int a, b ; scanf("%d%d", &a, &b) ;
printf("%lld\n", C(a, b) * cw[a - b] % MOD) ;
}
return 0 ;
}
/*
写代码时请注意:
1.ll?数组大小,边界?数据范围?
2.精度?
3.特判?
4.至少做一些
思考提醒:
1.最大值最小->二分?
2.可以贪心么?不行dp可以么
3.可以优化么
4.维护区间用什么数据结构?
5.统计方案是用dp?模了么?
6.逆向思维?
*/