Question

Vreau si eu un prgram recursiv pentru triunghiul lui pascal
Ex. k=4
1
1 1
1 2 1
1 3 3 1

Answer 1

#include<iostream>using namespace std;
int main() {int a[16][16],i,t,s,j,sw,x,y; sw=0; while (sw==0) { cout<<"Numarul de randuri:";cin>>t; if (t<=16 && t>=1)  sw=1; else cout<<"Numarul de randuri trebuie sa fie cuprins intre 1 si 16."; } cout<<"Incepe secventa de calculare."<<endl; a[1][1] = 1; if (t>=2)  {a[2][1] = 1; a[2][2] = 1; } if (t>=3) {for (i=3;i<=t;i++)     {s=0;     a[i][1]=1;     a[i][i]=1;     for (j=2;j<i;j++)     a[i][j]=a[i-1][j-1] + a[i-1][j];         } }  

cout<<a[1][1]<<endl; if (t>=2) cout<<a[2][1]<<" "<<a[2][2]<<endl; if (t>=3) for (x=3;x<=t;x++) {for (y=1;y<=x;y++) cout<<a[x][y]<<" "; cout<<endl; }}