给出n和k,求出二项式系数C(n,k)。在这里,我们只关心两个信息就够了:
C(n,k) = C(n-1,k-1) + C(n-1,k) 当n>k>0
C(n,0) = C(n,n) = 1
从上面的递推式可以看到两个较小的具有交叠性质的子问题C(n-1,k-1)和C(n-1,k),所以,计算二项式系数是把动态规划应用于非最优化问题的一个标准例子。
废话不多说,直接上代码:
#include
#include
using namespace std;
int main()
{
int n, k;
cout << "求C(n,k),请输入n和k(k <= n):";
cin >> n >> k;
int **p;
p = new int*[n + 1];
for (int i = 0; i <= n; i++)
p[i] = new int[k + 1];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= k; j++)
p[i][j] = 0;
for (int i = 0; i <= n; i++)
p[i][0] = 1; // C(n,0) = 0
for (int i = 0; i <= k; i++)
p[i][i] = 1; // C(n,n) = 1
for (int i = 2; i <= n; i++)
for (int j = 1; j < (i > k ? k + 1 : i); j++)
p[i][j] = p[i - 1][j - 1] + p[i - 1][j];
//cout.flags(ios::right); // 输出对齐
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= k; j++)
cout << setw(5) << p[i][j] << ' ';
cout << endl;
}
// 销毁空间
for (int i = 0; i <= n; i++)
delete[] p[i];
delete[] p;
return 0;
}
运行结果: