Cod sursa(job #1966939)
Utilizator | Data | 15 aprilie 2017 18:25:12 | |
---|---|---|---|
Problema | Permutari2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#define mod 10007
using namespace std;
ifstream fin("permutari2.in");
ofstream fout("permutari2.out");
int n,k,a[301][301],x[301],i,j,s,h;
int main(){
fin>>n>>k;
fin.close();
x[1]=1;
for(i=2;i<=n;i++)
x[i]=(i*x[i-1])%mod;
a[1][1]=1;
for(i=2;i<=n;i++){
s=0;
for(j=2;j<=i;j++){
for(h=j-1;h<i;h++)
a[i][j]=(a[i][j]+a[h][j-1]*a[i-h][1])%mod;
s=(s+a[i][j])%mod;
}
a[i][1]=x[i]-s;
a[i][1]=(a[i][1]+mod)%mod;
}
fout<<a[n][k];
fout.close();
return 0;
}