Pagini recente » Cod sursa (job #363365) | Cod sursa (job #2881217) | Cod sursa (job #3268387) | Cod sursa (job #2350996) | Cod sursa (job #2397109)
#include <fstream>
#define mod 10007
using namespace std;
ifstream f("permutari2.in");
ofstream g("permutari2.out");
int n,k,i,j,a,d[301][301],u[301][301];
int fact(int a){
int P=1;
for(int i=1;i<=a;i++)
P=(P*i)%mod;
return P;
}
int main()
{ f>>n>>k;
d[1][1]=d[1][0]=1;
u[1][1]=1;
for(i=2;i<=n;i++){
for(j=1;j<=i;j++){
d[i][j]=(d[i-1][j-1]+(i-j-1)*d[i-1][j]+d[i-1][j+1]-u[i-1][j+1])%mod;
u[i][j]=(u[i-1][j-1]+(i-j)*u[i-1][j]+u[i-1][j+1])%mod;
d[i][0]+=d[i][j];
}
}
g<<d[n][k];
return 0;
}