3664：Permutation Counting

题目描述

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.

输入解释

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 one line for each case. For the answer may be quite huge, you need to output the answer module 1,000,000,007.

输入样例

3 0
3 1

输出样例

1
4

提示

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}

来自杭电HDUOJ的附加信息

Recommend

lcy

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 2010 Asia Regional Harbin

源链接： HDU-3664

最后修改于 2020-10-25T23:05:46+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)