Pagini recente » Cod sursa (job #2788676) | Cod sursa (job #2852887) | Cod sursa (job #642158) | Cod sursa (job #163685) | Cod sursa (job #926043)
Cod sursa(job #926043)
#include<fstream>
#define MOD 10007
#define MN 305
using namespace std;
ifstream f("permutari2.in");
ofstream g("permutari2.out");
int D[MN][MN],F[MN],i,j,t,n,k,p;
int main()
{
f>>n>>k;
D[1][1]=1;
F[0]=1;
for(i=1;i<=n;++i)
F[i]=(i*F[i-1])%MOD;
for(i=2;i<=n;++i)
{
t=0;
for(j=2;j<=i;++j)
{
for(p=j-1;p<=i-1;++p)
D[i][j]=(D[i][j]+D[p][j-1]*D[i-p][1])%MOD;
t+=D[i][j];
if(t>=MOD)
t-=MOD;
}
D[i][1]=F[i]-t;
if(D[i][1]<0)
D[i][1]+=MOD;
}
g<<D[n][k];
return 0;
}