|
||||||||||
Permutation CountingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2046 Accepted Submission(s): 1097 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
Sample Output
Hint There 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} Source | ||||||||||
|