链接:点击打开链接
题意:1~N个数组成的序列,求长度为n,ai>i的个数为k的序列的种数
代码:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const long long MOD=1000000007;
long long dp[1005][1005];
int main(){
long long n,k,i,j;
for(i=1;i<=1000;i++){
for(j=1;j<=i;j++){
if(j==1||j==i)
dp[i][j]=1;
else
dp[i][j]=(j*dp[i-1][j]+(i-j+1)*dp[i-1][j-1])%MOD;
}
} //通过next_permutation算出前几个数的
while(scanf("%I64d%I64d",&n,&k)!=EOF){ //的答案硬是找到了规律....
printf("%I64d\n",dp[n][k+1]);
}
return 0;
}