Permutation Counting
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 187 Accepted Submission(s): 119
Problem Description
Given a permutation a1, a2, … aN of {1, 2, …, N}, we define its E-value as the amount of elements where ai > i. For example, the E-value of permutation {1, 3, 2, 4} is 1, while the E-value of {4, 3, 2, 1} is 2. You are requested to find how many permutations of {1, 2, …, N} whose E-value is exactly k.
Input
There are several test cases, and one line for each case, which contains two integers, N and k. (1 <= N <= 1000, 0 <= k <= N).
Output
Output one line for each case. For the answer may be quite huge, you need to output the answer module 1,000,000,007.
Sample Input
3 0 3 1
Sample Output
1 4HintThere is only one permutation with E-value 0: {1,2,3}, and there are four permutations with E-value 1: {1,3,2}, {2,1,3}, {3,1,2}, {3,2,1}#include<iostream>
#include<cstdio>
using namespace std;
const int mod=1000000007;
__int64 a[1100][1100];
void init()
{
for(int i=1;i<1100;i++)
{
a[i][0]=1;
for(int j=1;j<=i;j++)
{
a[i][j]=((j+1)*a[i-1][j]+(i-1-(j-1))*a[i-1][j-1])%mod;
}
}
}
int main()
{
init();
int n,k;
while(scanf("%d%d",&n,&k)==2)
{
printf("%I64d/n",a[n][k]);
}
return 0;
}