CF285E.Positions in Permutations

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Permutation $p$ is an ordered set of integers $p_{1},p_{2},...,p_{n}$ , consisting of $n$ distinct positive integers, each of them doesn't exceed $n$ . We'll denote the $i$ -th element of permutation $p$ as $p_{i}$ . We'll call number $n$ the size or the length of permutation $p_{1},p_{2},...,p_{n}$ .

We'll call position $i$ ( $1<=i<=n$ ) in permutation $p_{1},p_{2},...,p_{n}$ good, if $|p[i]-i|=1$ . Count the number of permutations of size $n$ with exactly $k$ good positions. Print the answer modulo $1000000007$ ( $10^{9}+7$ ).

输入格式

The single line contains two space-separated integers $n$ and $k$ ( $1<=n<=1000,0<=k<=n$ ).

输出格式

Print the number of permutations of length $n$ with exactly $k$ good positions modulo $1000000007$ ( $10^{9}+7$ ).

输入输出样例

输入#1
```
1 0
```
输出#1
```
1
```
输入#2
```
2 1
```
输出#2
```
0
```
输入#3
```
3 2
```
输出#3
```
4
```
输入#4
```
4 1
```
输出#4
```
6
```
输入#5
```
7 4
```
输出#5
```
328
```

说明/提示

The only permutation of size 1 has 0 good positions.

Permutation $(1,2)$ has 0 good positions, and permutation $(2,1)$ has 2 positions.

Permutations of size 3:

$(1,2,3)$ — 0 positions
— 2 positions
— 2 positions
— 2 positions
— 2 positions
$(3,2,1)$ — 0 positions

首页