Có một số vấn đề với mã của bạn như điều kiện chấm dứt đệ quy:
if[n == 1 && i == 1 ]
Điều này không đúng và dẫn đến việc tái sử dụng chức năng mãi mãi và cuối cùng chương trình sẽ chấm dứt bất thường.
Hơn nữa, nếu bạn sửa chữa điều kiện này, bạn sẽ không lấy hình tam giác Pascal làm đầu ra vì cả hai vòng ____99 trong
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0 đều khởi tạo biến vòng lặp với if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1 sẽ ăn hết cột đầu tiên của mỗi hàng hình tam giác Pascal.Đối với điều kiện chấm dứt của chức năng đệ quy
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
2 -Trong hàm
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
3, if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
4 đại diện cho hàng trong khi if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
5 biểu thị cột trong hàng cụ thể đó và hàm if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
6 được cho là để tính toán phần tử tại một vị trí cụ thể.Một vài điểm, trong Tam giác Pascal:
Phần tử ngoài cùng bên trái và ngoài cùng bên phải của mỗi hàng là
1.if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1; return 1;
Mỗi hàng chứa số lượng cột giống như số hàng.
Vì vậy, tôi có thể nói -
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
có thể là điều kiện chấm dứt của chức năng đệ quy.
Chung, chương trình của bạn sẽ là một cái gì đó như thế này:
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
Hi vọng điêu nay co ich.
Tam giác Pascal là một mảng hình tam giác gồm các hệ số nhị thức. Viết một hàm lấy giá trị số nguyên n làm đầu vào và in đầu tiên n của tam giác pascal. Sau đây là 6 hàng đầu tiên của hình tam giác Pascal.
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1
Phương pháp 1 [O [N^3] Độ phức tạp thời gian] & NBSP; Số lượng mục nhập trong mỗi dòng bằng số dòng. Ví dụ, dòng đầu tiên có 1 1, dòng thứ hai có 1 1 1, dòng thứ ba có dòng 1 1 1 1, .. v.v. Mỗi mục trong một dòng là giá trị của một hệ số nhị thức. Giá trị của mục nhập ith trong dòng dòng là c [dòng, i]. Giá trị có thể được tính bằng cách sử dụng công thức sau. & Nbsp;
The number of entries in every line is equal to line number. For example, the first
line has “1”, the second line has “1 1”, the third line has “1 2 1”,.. and so on. Every entry in a line is value of a Binomial Coefficient. The value of ith entry in line number line is C[line, i]. The value can be calculated using following formula.
C[line, i] = line! / [ [line-i]! * i! ]
Một phương pháp đơn giản là chạy hai vòng và tính giá trị của hệ số nhị thức trong vòng lặp bên trong. & NBSP;
C++
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
8if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
9 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
0 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
1#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
7#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ]4
C[line, i] = line! / [ [line-i]! * i! ]5
C[line, i] = line! / [ [line-i]! * i! ]6
C[line, i] = line! / [ [line-i]! * i! ]7
C[line, i] = line! / [ [line-i]! * i! ]8
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ]6
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 18
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time9
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 for
31 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
7#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ]4
C[line, i] = line! / [ [line-i]! * i! ]5
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
251 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
27if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
28if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
29if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
30C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
251 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 18
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time9
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 for
31 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
Java
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
83 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
84if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
85 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
861 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
99#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
011 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
10C[line, i] = line! / [ [line-i]! * i! ]0
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
12#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
13#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
14C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
181 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
35if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 18
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time0
C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
49C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]5
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time9
C[line, i] = line! / [ [line-i]! * i! ]5
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
55if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
691 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
74#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
751 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
Python3
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
82 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
831 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
86#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
881 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
91C[line, i] = line! / [ [line-i]! * i! ]0
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
94#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 104
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 105
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 106
C[line, i] = line! / [ [line-i]! * i! ]7
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 108
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 110
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 104
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 113
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
82 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 115
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 117
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1222
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 123
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 124
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 126
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 128
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 123
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 130
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
94#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 117
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 117
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 143
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 144
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 123
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 146
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 117
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 117
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 151
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 151
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 153
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 100
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 159
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 128
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
751 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 163
C#
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
9 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 165
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
85 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
861 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
99#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
01C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
101 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 189
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
13#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
14C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 195
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
35if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 18
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time0
C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
49C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]5
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time9
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
691 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 for
31 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
31
1 1
1 2 1
1 3 3 1
1 4 6 4 1
5 for
8
C[line, i] = line! / [ [line-i]! * i! ]51
Java
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
83 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
84if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
85 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
861 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
99#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
011 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
101 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
3#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
5#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
35if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 18
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
491 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
691 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
74#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
751 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]54
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 156
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9C[line, i] = line! / [ [line-i]! * i! ]54
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 160
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
82 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
83
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 161
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
C[line, i] = line! / [ [line-i]! * i! ]52
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 163
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 169
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 174
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 176
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
13#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
14C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 182
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 183
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
C[line, i] = line! / [ [line-i]! * i! ]52
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 191
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 195
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 18
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time0
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 103
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]5
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time9
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 11
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 118
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 121
Đầu ra
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1
Độ phức tạp về thời gian: O [n^3] Không gian phụ trợ: O [1]O[n^3]
Auxiliary Space: O[1]
Phương pháp 2 [O [N^2] Thời gian và O [N^2] Không gian bổ sung] & nbsp; Nếu chúng ta tiến gần hơn ở tam giác, chúng ta quan sát thấy mọi mục nhập là tổng của hai giá trị trên nó. Vì vậy, chúng ta có thể tạo một mảng 2D lưu trữ các giá trị được tạo trước đó. Để tạo giá trị trong một dòng, chúng ta có thể sử dụng các giá trị được lưu trữ trước đó từ Array. & NBSP; & NBSP;
If we take a closer at the triangle, we observe that every entry is sum of the two values above it. So we can
create a 2D array that stores previously generated values. To generate a value in a line, we can use the previously stored values from array.
C++
1 1 1 1 2 1 1 3 3 1 1 4 6 4 122
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
9 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
0 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
1#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 133
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ]4
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 150
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 152
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 156
1 1 1 1 2 1 1 3 3 1 1 4 6 4 157
1 1 1 1 2 1 1 3 3 1 1 4 6 4 158
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 160
C[line, i] = line! / [ [line-i]! * i! ]7
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 166
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 133
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ]4
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 152
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
251 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
27C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time16
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
251 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 150
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 133
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ]4
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 150
C[line, i] = line! / [ [line-i]! * i! ]0
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
Java
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
83 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
841 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
85 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
86C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time89
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time95
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time97
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time99
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 101
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 103
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 107
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 140
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
Python3
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time45
C[line, i] = line! / [ [line-i]! * i! ]0
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
74C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time49
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time63
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time64
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time66
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
99#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
011 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
101 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time85
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
001 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 156
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
82 1 1 1 1 2 1 1 3 3 1 1 4 6 4 114
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2222C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
1 1 1 1 2 1 1 3 3 1 1 4 6 4 173
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 118
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
1 1 1 1 2 1 1 3 3 1 1 4 6 4 120
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00 for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 123__
1 1 1 1 2 1 1 3 3 1 1 4 6 4 127
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 129
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
881 1 1 1 2 1 1 3 3 1 1 4 6 4 126
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
86#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
88C[line, i] = line! / [ [line-i]! * i! ]0
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
94#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
88 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
00#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
99__C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 153
1 1 1 1 2 1 1 3 3 1 1 4 6 4 155
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 163
C#
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 106
1 1 1 1 2 1 1 3 3 1 1 4 6 4 162____
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 106
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 104
1 1 1 1 2 1 1 3 3 1 1 4 6 4 167
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
C[line, i] = line! / [ [line-i]! * i! ]7
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 156
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0____9
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 C[line, i] = line! / [ [line-i]! * i! ]4
C[line, i] = line! / [ [line-i]! * i! ]0
for
401 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
C[line, i] = line! / [ [line-i]! * i! ]0
for
44for
45for
46
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
481 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
for
51
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 140
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 for
591 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
PHP
C[line, i] = line! / [ [line-i]! * i! ]51
C[line, i] = line! / [ [line-i]! * i! ]52
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9C[line, i] = line! / [ [line-i]! * i! ]54
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 156
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
Các
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
C[line, i] = line! / [ [line-i]! * i! ]82
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
C[line, i] = line! / [ [line-i]! * i! ]81
C[line, i] = line! / [ [line-i]! * i! ]82
C[line, i] = line! / [ [line-i]! * i! ]81
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
011C[line, i] = line! / [ [line-i]! * i! ]81
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 106
for
75if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0181 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
020C[line, i] = line! / [ [line-i]! * i! ]81
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
022C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
Các
‘
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 139
for
75if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0181 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
020C[line, i] = line! / [ [line-i]! * i! ]81
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0522.C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 139
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]54
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
065#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9C[line, i] = line! / [ [line-i]! * i! ]54
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 160
JavaScript
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 161
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
071 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
for
5
C[line, i] = line! / [ [line-i]! * i! ]52
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 163
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
077for
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0791 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0831 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 17
1 1 1 1 2 1 1 3 3 1 1 4 6 4 150
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 152
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 154
C[line, i] = line! / [ [line-i]! * i! ]0
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
0961 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 182
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
101if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 121
Đầu ra
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1
Phương pháp này có thể được tối ưu hóa để sử dụng không gian thêm O [n] vì chúng ta chỉ cần các giá trị từ hàng trước. Vì vậy, chúng ta có thể tạo một mảng phụ trợ có kích thước N và ghi đè lên các giá trị. Sau đây là một phương pháp khác chỉ sử dụng o [1] không gian thêm.Method 3 [o [n^2] thời gian và o [1] không gian thêm Dòng là hệ số nhị thức c [dòng, i] và tất cả các dòng bắt đầu bằng giá trị 1. Ý tưởng là tính toán c [dòng, i] sử dụng c [dòng, i-1]. Nó có thể được tính theo thời gian O [1] bằng cách sử dụng các phần sau. & Nbsp; & nbsp;
Method 3 [ O[n^2] time and O[1] extra space
]
This method is based on method 1. We know that ith entry in a line number line is Binomial Coefficient C[line, i] and all lines start with value 1. The idea is to calculate C[line, i] using C[line, i-1]. It can be calculated in O[1] time using the following.
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time
C++
1 1 1 1 2 1 1 3 3 1 1 4 6 4 122
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
9 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
0 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
1#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1181 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1221 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1271 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
131C[line, i] = line! / [ [line-i]! * i! ]7
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1391 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1181 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1221 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1271 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
251 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
27if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1801 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
251 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
01 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 15
for
81 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
Java
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
83 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
841 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
85 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
861 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
99if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1____12201 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
238C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
225if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
181 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
08if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1____2101 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
Python3
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time45
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
74C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time49
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
82 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
2641 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
86#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
277 ____309 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
11 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 122
C[line, i] = line! / [ [line-i]! * i! ]0
for
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
94#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
87C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 104
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
3111 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 128
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 109
C[line, i] = line! / [ [line-i]! * i! ] C[line, i-1] = line! / [ [line - i + 1]! * [i-1]! ] We can derive following expression from above two expressions. C[line, i] = C[line, i-1] * [line - i + 1] / i So C[line, i] can be calculated from C[line, i-1] in O[1] time49
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 12
for
5
C#
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
9 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 165
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
85 for
101 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 11
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
333C[line, i] = line! / [ [line-i]! * i! ]5
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
3351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
3401 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1271 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
349C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
3571 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
3591 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
66 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
88 #include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
8 for
591 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
2 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
51 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
PHP
C[line, i] = line! / [ [line-i]! * i! ]51
C[line, i] = line! / [ [line-i]! * i! ]52
#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9C[line, i] = line! / [ [line-i]! * i! ]54
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 156
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
385______5171 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
395 C[line, i] = line! / [ [line-i]! * i! ]61
Các
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 104
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
395 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
414C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]5
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
395 C[line, i] = line! / [ [line-i]! * i! ]73
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
395 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
4211 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 117
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]0
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 104
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 15
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
C[line, i] = line! / [ [line-i]! * i! ]54
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
065#include
long paskal[int, int];
int main[] {
int n = 0;
int m = 0;
int k = 0;
int s = 0;
printf ["Enter number of rows:\n"];
scanf["%d", &n];
for[k = 0; n >= k; k++] {
for[s = 0; s < n-k; s++] //Add spaces before each row
printf[" "];
for[m = 0; k >= m; m++] {
long f = paskal[k, m];
printf["%ld ", f];
}
printf["\n"];
}
return 0;
}
long paskal[int n, int i] {
if[n == i || i == 0]
return 1;
else
return paskal[n-1, i] + paskal[n-1, i-1];
}
9C[line, i] = line! / [ [line-i]! * i! ]54
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 160
JavaScript
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 161
C[line, i] = line! / [ [line-i]! * i! ]52
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 163
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
4501 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
071 if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
4551 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
for
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
4581 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 12
C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
462C[line, i] = line! / [ [line-i]! * i! ]7
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
35C[line, i] = line! / [ [line-i]! * i! ]0
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
1351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 182
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
101if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
351 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 13
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 14
if[n == i || i == 0] //i.e. if [[row == col] || [col == 0]] return 1;
return 1;
071 1 1 1 1 2 1 1 3 3 1 1 4 6 4 177
for
5
1 1 1 1 2 1 1 3 3 1 1 4 6 4 121
Đầu ra
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1
Độ phức tạp về thời gian: O [N2] Không gian phụ trợ: O [1]O[n2]
Auxiliary Space: O[1]
Vì vậy, phương pháp 3 là phương pháp tốt nhất trong số tất cả, nhưng nó có thể gây ra tràn số nguyên cho các giá trị lớn của N vì nó nhân hai số nguyên để thu được các giá trị. & NBSP;
Bài viết này được tổng hợp bởi Rahul và được xem xét bởi nhóm GeekSforGeeks. Vui lòng viết nhận xét nếu bạn tìm thấy bất cứ điều gì không chính xác, hoặc bạn muốn chia sẻ thêm thông tin về chủ đề được thảo luận ở trên. & NBSP;Rahul and reviewed by GeeksforGeeks team. Please write comments if you find anything incorrect, or you want to share more information
about the topic discussed above.