Cod sursa(job #2404273)
Utilizator | Data | 12 aprilie 2019 14:30:09 | |
---|---|---|---|
Problema | Permutari2 | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
#include <cstring>
#define mod 10007
using namespace std;
ifstream f("permutari2.in");
ofstream g("permutari2.out");
int d[305][305],n,k,i,j,l,p;
inline void a(){
p=1;
d[1][1]=1;
for(i=2;i<=n;i++){
p=p*i%mod;
d[i][1]=p;
for(j=2;j<=i;j++){
for(l=i-1;l>=j-1;l--){
d[i][j]=(d[i][j]+d[l][j-1]*d[i-l][1])%mod;
}
d[i][1]=(d[i][1]-d[i][j]+mod)%mod;
}
}
}
int main()
{ f>>n>>k;
a();
g<<d[n][k];
return 0;
}