Pagini recente » Cod sursa (job #1905771) | Cod sursa (job #47596) | Cod sursa (job #2590059) | Cod sursa (job #1604806) | Cod sursa (job #1555783)
#include<cstdio>
#define n1 10007
int ma[302][302];
int main ()
{
freopen("permutari2.in","r",stdin);
freopen("permutari2.out","w",stdout);
int n,k,x,i,j,l;
long long p;
x=1;
scanf("%d%d",&n,&k);
ma[1][1]=1;
for(i=2;i<=n;i++)
{
x*=i;
x%=n1;
ma[i][1]=x;
for(j=2;j<=i;j++)
{p=0;
for(l=j-1;l<i;l++)
p+=ma[l][j-1]*ma[i-l][1];
ma[i][j]=p%n1;
ma[i][1]=(ma[i][1]-ma[i][j]+n1)%n1;
}
}
printf("%d",ma[n][k]);
return 0;
}