Pagini recente » Cod sursa (job #1875254) | Cod sursa (job #2088565) | Cod sursa (job #2187399) | Cod sursa (job #2926893) | Cod sursa (job #2096362)
#include <bits/stdc++.h>
#define Nmax 301
#define MOD 10007
using namespace std;
ifstream f("permutari2.in");
ofstream g("permutari2.out");
int pd[Nmax][Nmax];
int main()
{
int n,k,i,j,t,sum;
f>>n>>k;
pd[1][1]=1;
int fct=1;
for(i=2;i<=n;i++)
{
pd[i][1]=fct=(fct*i)%MOD;
for(j=2;j<=i;j++)
{
for(t=j-1;t<i;t++)
pd[i][j]=(pd[i][j]+(pd[t][j-1]*pd[i-t][1])%MOD)%MOD;
pd[i][1]=(pd[i][1]-pd[i][j]<0?pd[i][1]-pd[i][j]+MOD:pd[i][1]-pd[i][j]);
}
}
g<<pd[n][k]<<'\n';
return 0;
}