-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathbinomial_coefficient.cpp
71 lines (59 loc) · 1.21 KB
/
binomial_coefficient.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <iostream>
#include <cstdio>
#include <conio.h>
#include <cstdlib>
#include <limits.h>
#include <cassert>
using namespace std;
typedef int* TypePoint;
TypePoint* binomialData = NULL;
int DoBinomial(int n ,int k)
{
for (int i=0; i<=n; i++)
{
for (int j=0; j<= (i<k ? i:k); j++)
{
if (j==0 || j==i)
binomialData[i][j] = 1;
else
binomialData[i][j] = binomialData[i-1][j-1]+binomialData[i-1][j];
}
}
return binomialData[n][k];
}
int main()
{
char c;
do
{
system("cls");
cout << "\n\n\n 请输入二项式系数C(n,k)的n ,k 的值:";
int n , k;
cin >> n >> k;
binomialData = new int*[n+1];
assert (binomialData);
for (int i=0; i<n+1; i++)
{
binomialData[i] = new int [k+1];
}
for (int i=0; i<=n; i++)
{
for (int j=0; j<=k; j++)
binomialData[i][j] = 0;
}
cout << "\n 二项式系数C(n,k)的值:" << DoBinomial(n ,k) << endl;
for (int i=0; i<=n; i++)
{
cout << " ";
for (int j=0; j<=k; j++)
cout << " " << binomialData[i][j];
cout << endl;
}
for (int i=0; i<=n; i++)
delete[] binomialData[i];
delete[] binomialData;
cout << "\n\n !!!按任意键继续,Esc退出程序!!!" << endl;
}while( (c=getch())!=27 );
return 0;
}