P4071 [SDOI2016]排列计数（全错排）

最新推荐文章于 2024-02-04 21:17:21 发布

漆黑之翼²

最新推荐文章于 2024-02-04 21:17:21 发布

阅读量107

点赞数

分类专栏： # 刷题之旅

本文链接：https://blog.csdn.net/weixin_45714726/article/details/115630015

版权

全错排递推公式组合计数模运算组合数学

关键词由CSDN通过智能技术生成

刷题之旅专栏收录该内容

74 篇文章 0 订阅

订阅专栏

传送门

全错排递推为D[x]=(x-1)*(D[x-1]+D[x-2])
B站推导

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
#include<map>
#include<bitset>
#include<unordered_map>
using namespace std;
#define LL long long
#define eps (1e-9)
typedef unsigned long long ull;

const int maxn = 1e6 + 10;
const LL inf = 1e18;
const double pi = acos(-1.0);
const int bas = 131;
const LL mod = 1e9 + 7;

LL D[maxn + 10];
LL fac[maxn + 10], inv[maxn + 10];
LL qpow(LL a, LL b)
{
	LL res = 1;
	while (b)
	{
		if (b & 1)res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}
void init()
{
	fac[0] = inv[0] = 1;
	for (int i = 1; i <= maxn; i++)
	{
		fac[i] = fac[i - 1] * i % mod;
	}
	inv[maxn] = qpow(fac[maxn], mod - 2);
	for (int i = maxn - 1; i >= 1; i--)
	{
		inv[i] = inv[i + 1] * (i + 1) % mod;
	}
	D[1] = 0, D[2] = 1;
	for (LL i = 3; i <= maxn; i++)
	{
		D[i] = (i - 1) * (D[i - 1] + D[i - 2]) % mod;
	}
}
LL cal(int n, int m)
{
	if (n < m)return 0;
	else if (n == m)return 1;
	else return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main()
{
	init();
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int n, m;
		scanf("%d%d", &n, &m);
		if (n == m)printf("1\n");
		else if (m == 0)printf("%lld\n", D[n]);
		else if (m > n)printf("0\n");
		else
		{
			LL ans = cal(n, m) * D[n - m] % mod;
			printf("%lld\n", ans);
		}
	}
	return 0;
}