Cod sursa(job #1555715)
| Utilizator | Data | 23 decembrie 2015 14:48:05 | |
|---|---|---|---|
| Problema | Permutari2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<cstdio>
#define n1 10007
int a[302][302],i,j,n,m,k1,x=1,l;
int main ()
{
freopen("permutari2.in","r",stdin);
freopen("permutari2.out","w",stdout);
scanf("%d%d",&n,&k1);
a[1][1]=1;
for(i=2;i<=n;i++)
{
x*=i;
x%=n1;
a[i][1]=x;
for(j=2;j<=i;j++)
{
long long k=0;
for(l=j-1;l<i;l++)
k+=a[l][j-1]*a[i-l][1];
a[i][j]=k%n1;
a[i][1]=(a[i][1]-a[i][j]+n1)%n1;
}
}
printf("%d",a[n][k1]);
return 0;
}
