错排公式
有一个有n个元素的排列,所有元素均不在自己位置上称为完全错排。n个元素的错排数记为D(n)
long long D[25];//存储前n个错排D(n)
void cp()
{
D[1] = 0; D[2] = 1;
for (int i = 3; i < 21; i++)
{
D[i] = (i - 1)*(D[i - 1] + D[i - 2]);
}
}
卡特兰数
摘自:https://blog.csdn.net/qq_36428388/article/details/77466410
一.Mod1e9+7版
long long n;
const long long M = 1000000007;
long long inv[1000010];
long long last, now = 1;
void init()//求值
{
inv[1] = 1;
for (int i = 2; i <= n + 1; i++)inv[i] = (M - M / i)*inv[M%i] % M;
}
int main()
{
scanf_s("%lld", &n);
init();
for (int i = 2; i <= n; i++)
{
last = now;
now = last * (4 * i - 2) % M*inv[i + 1] % M;
}
printf_s("%lld\n", last);//输出第n位卡特兰数
return 0;
}
二.无mod版
int a[105][100];//第 n个卡特兰数存在a[n]中,a[n][0]表示长度
void ktl()
{
int i, j, yu, len;
a[2][0] = 1;
a[2][1] = 2;
a[1][0] = 1;
a[1][1] = 1;
len = 1;
for (i = 3; i<101; i++)
{
yu = 0;
for (j = 1; j <= len; j++)
{
int t = (a[i - 1][j])*(4 * i - 2) + yu;
yu = t / 10;
a[i][j] = t % 10;
}
while (yu)
{
a[i][++len] = yu % 10;
yu /= 10;
}
for (j = len; j >= 1; j--)
{
int t = a[i][j] + yu * 10;
a[i][j] = t / (i + 1);
yu = t % (i + 1);
}
while (!a[i][len])
{
len--;
}
a[i][0] = len;
}
}
int main()
{
ktl();
int T, n;
scanf_s("%d", &T);//T个数
while (T--)
{
scanf_s("%d", &n);
for (int i = a[n][0]; i > 0; i--)
//注意数是倒着存的,个位是a[n][1]输出时注意倒过来
printf_s("%d", a[n][i]);//输出第n个卡特兰数
puts("");//换行
}
return 0;
}