-
Notifications
You must be signed in to change notification settings - Fork 55
/
Copy pathPascal's triangle.c
196 lines (83 loc) · 2.31 KB
/
Pascal's triangle.c
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
//binomial coefficient (n k) = n!/(k!*(n-k)!)
double binom (int n, int k);
// product of n*(n-1)*...*k
double fact (int n, int k);
int main()
{
int i;
int j;
int n=10; // rows' number by default
int lastStrLenght=0;
int spcNum=0;
printf("Enter a number of rows: "); //10 rows by default
//scanf("%d", &n);
std::cin >> n;
printf("%d\nPascal's Triangle for %d rows\n", n, n);
char prstr[100];
*prstr = '\0';
//dynamic allocation memory for rows
double ** ptri;
ptri = (double**) malloc(n*sizeof(double));
for (i=0; i<n; i++) {
ptri[i] = (double*) malloc((i+1)*sizeof(double));
}
//calculating of binomial coefficients and adding it to dynamic array
for (i=0; i<n; i++) {
for(j=0; j<i+1; j++) {
ptri[i][j] = binom(i, j);
}
}
//calculating of max row lenght
for (j=0; j<n; j++) {
sprintf (prstr, "%.0f ", ptri[n-1][j]);
lastStrLenght += strlen(prstr);
}
char str[lastStrLenght];
*str='\0';
//printing of dynamic array
for (i=0; i<n; i++) {
for (j=0; j<i+1; j++) {
sprintf (prstr, "%.0f ", ptri[i][j]);
strcat (str, prstr);
}
//printing spaces to align current row about last row
spcNum = (lastStrLenght - strlen(str))/2;
for (j=1; j<=spcNum; j++) {
printf (" ");
} //
printf ("%s\n", str); //printing of current row
*str='\0';
}
//free the array memory
for (i=0; i<n; i++){
free(ptri[i]);
}
free(ptri); //
return 0;
}
//binomial coefficient (n k) = n!/(k!*(n-k)!)
double binom (int n, int k)
{
double res = 1;
if (k>(n-k)) { // which bigger k or n-k
res = fact(n, k+1)/fact(n-k, 1); // n! / k!*(n-k)! = n*(n-1)*...*(k+1)/(n-k)*(n-k-1)*...*1
}
else {
res = fact(n, n-k+1)/fact(k, 1); // n! / k!*(n-k)! = n*(n-1)*...*(n-k+1)/k*(k-1)*...*1
}
return res;
}
// product of n*(n-1)*...*k
double fact (int n, int k)
{
int i;
double res = 1;
for (i=k; i<=n; i++) {
res*=i;
}
return res;
}