Pagini recente » Cod sursa (job #1446578) | Cod sursa (job #1149374) | Cod sursa (job #1138330) | Cod sursa (job #2986787) | Cod sursa (job #2510746)
#include <bits/stdc++.h>
using namespace std;
ifstream in("permutari2.in");
ofstream out("permutari2.out");
int dp[305][305], v[305];
int main()
{
int n, k;
in >> n >> k;
dp[1][1] = v[1] = 1;
for(int i = 2; i <= n; i++)
{
v[i] = (v[i - 1]) * i % 10007;
dp[i][1] = v[i];
}
for(int i = 2; i <= n; i++)
{
for(int j = 1; j < i; j++)
{
dp[i][1] = ((dp[i][1] - v[j] * dp[i - j][1] % 10007) + 10007) % 10007;
for(int l = 2; l <= min(i, k); l++)
dp[i][l] = (dp[i][l] + dp[j][l - 1] * dp[i - j][1]) % 10007;
}
}
out << dp[n][k];
return 0;
}