Triunghiul lui Pascal

#include<iostream>
using namespace std;

int vectori(int n, int k)
{int v[100], u[100], i, j, t;
v[0]=1;
for(i=0;i<n;i++)
    if(i==0)
        u[i]=0;
    else u[i]=v[i]+v[i-1];
}

int main()
{int k,t,i=0,j=0,n,a[100][100]={0},nn,kk;
cin>>n;
for(i=0;i<n;i++)
    for(j=0;j<=i;j++)
        if(j==0)
            a[i][j]=1;
        else a[i][j]=a[i-1][j]+a[i-1][j-1];

for(k=0;k<n;k++)
    {for(t=0;t<k+1;t++)
        cout<<a[k][t]<<" ";
    cout<<endl;}
    cout<<"citire"<<endl;
    cin>>nn>>kk;
    cout<<"Combinari de "<<nn<<" luate cate "<<kk<<"="<<a[nn][kk];
}