Pagini recente » Cod sursa (job #559382) | Cod sursa (job #1811523) | Cod sursa (job #791460) | Cod sursa (job #242121) | Cod sursa (job #2404243)
#include <fstream>
#include <cstring>
#define mod 10007
using namespace std;
ifstream f("permutari2.in");
ofstream g("permutari2.out");
int d[301][301],n,k,i,j,l,S,fact[301];
int main()
{ f>>n>>k;
fact[0]=1;
for(i=1;i<=n;i++)
fact[i]=(fact[i-1]*i)%mod;
d[1][1]=1;
for(i=1;i<=n;i++){
S=0;
for(j=2;j<=i;j++){
l=i-1;
while(l>=j-1){
d[i][j]=(d[i][j]+d[l][j-1]*d[i-l][1])%mod;
l--;
}
S=(S+d[i][j])%mod;
}
d[i][1]=(fact[i]-S)%mod;
if(d[i][1]<0)
d[i][1]+=mod;
}
g<<d[n][k];
return 0;
}