N wizards are attending a meeting. Everyone has his own magic wand. N magic wands was put in a line, numbered from 1 to n(Wand_i owned by wizard_i). After the meeting, n wizards will take a wand one by one in the order of 1 to n. A boring wizard decided to reorder the wands. He is wondering how many ways to reorder the wands so that at least k wizards can get his own wand.
For example, n=3. Initially, the wands are w1 w2 w3. After reordering, the wands become w2 w1 w3. So, wizard 1 will take w2, wizard 2 will take w1, wizard 3 will take w3, only wizard 3 get his own wand.
Input
First line contains an integer T (1 ≤ T ≤ 10), represents there are T test cases.
For each test case: Two number n and k.
1<=n <=10000.1<=k<=100. k<=n.
Output
For each test case, output the answer mod 1000000007(10^9 + 7).
Sample Input
2 1 1 3 1
Sample Output
1 4
题意:有n个魔法师(?),去拿n根魔法棒,每人有专属的一根,问至少有k个人拿对魔法棒的方案数。
思路:至少有k个人拿对,我们就可以假设此时有x个人拿对(k<=x<=n),那么肯定有(n-x)个人完全拿错。
对于x个人拿对的情况,其方案数为 组合数 C( n , x ),那么对于(n-x)个人拿错的情况,其方案数可有错排公式求得。对于一个x 两种方案数相乘 累加即可。切记全拿对也符合情况,但错排公式是num[0]=0,两者相乘还是0,所以首先要 +1 。
错排公式 num[0]=0,num[1]=0,num[2]=1;
num[ i ] = ( i - 1 ) * ( num[ i - 1 ] + num[ i -2 ] )
组合数:C(n,m) = n! / m! * ( n - m )! 有个小优化,初始时直接求出100w以内的所有数的阶乘。
求逆元: a / b % mod
int x , y ;
ex_gcd( b , mod , x , y );
结果:( a*x%mod + mod )%mod
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define mod 1000000007
using namespace std;
ll num[10010],jie[10010];
ll ex_gcd(ll a,ll b,ll &x,ll &y)
{
if(!b)
{
x=1,y=0;
return a;
}
ll d=ex_gcd(b,a%b,y,x);
y-=(a/b)*x;
return d;
}
ll work(int n,int k)
{
ll x,y;
ll sum1=jie[n],sum2=jie[k]*jie[n-k]%mod;
ll d=ex_gcd(sum2,mod,x,y);
return (sum1*x%mod+mod)%mod;
}
void init()
{
num[2]=1;
for(int i=3; i<=10000; i++)
num[i]=((i-1)*(num[i-1]+num[i-2]))%mod;
jie[1]=1;
for(int i=2; i<=10000; i++)
jie[i]=(jie[i-1]*i)%mod;
}
int main()
{
init();
int t;
scanf("%d",&t);
while(t--)
{
int n,k;
scanf("%d%d",&n,&k);
ll cnt=1;
for(int i=k; i<n; i++)
{
cnt=(cnt+(work(n,i)*num[n-i])%mod)%mod;
}
printf("%lld\n",cnt);
}
return 0;
}