Pagini recente » Cod sursa (job #1795425) | Cod sursa (job #2921508) | Cod sursa (job #64903) | Cod sursa (job #3265201) | Cod sursa (job #466504)
Cod sursa(job #466504)
#include<stdio.h>
#define MOD 10007
int n,k;
int f[305],a[305],d[305][305];
int main ()
{
int i,j,z;
freopen("permutari2.in","r",stdin);
freopen("permutari2.out","w",stdout);
scanf("%d%d",&n,&k);
f[0]=1;
for(i=1;i<=n;i++)
f[i]=(f[i-1]*i)%MOD;
a[0]=1;a[1]=1;
for(i=2;i<=n;i++)
{
a[i]=f[i];
for(j=1;j<i;j++)
{
a[i]-=(a[j]*f[i-j])%MOD;
if(a[i]<0)
a[i]+=MOD;
}
}
for(i=1;i<=n;i++)
d[1][i]=a[i];
for(i=2;i<=k;i++)
for(j=i;j<=n;j++)
for(z=i-1;z<j;z++)
d[i][j]=(d[i][j]+d[i-1][z]*a[j-z])%MOD;
printf("%d\n",d[k][n]);
return 0;
}