杭电ACM 2032 杨辉三角

http://acm.hdu.edu.cn/showproblem.php?pid=2032

a[i][j]=a[i-1][j]+a[i-1][j-1]

#include <iostream>#include <vector>using namespace std;int main(){int n;int a[30][30];while(cin>>n){for(int i=0;i<n;i++){for(int j=0;j<=i;j++){if(j==0||j==i) a[i][j]=1;else a[i][j]=a[i-1][j]+a[i-1][j-1];}}for(int i=0;i<n;i++){    for(int j=0;j<=i;j++){        if(j!=0) cout<<" ";        cout<<a[i][j];}cout<<endl;}cout<<endl;}return 0;}