HDU2032 杨辉三角[入门]

using namespace std;
#include <iostream>

int pascal[30+1][30+1];

void pascalgo(int n){
	int i,j;
 
    for(i=0; i<n; i++)			//注意，此处i<n，即为0到i有n个数字
        for(j=0; j<=i; j++)		//j<=i
            if(j == 0 || j == i)
                pascal[i][j] = 1;
            else
                pascal[i][j] = pascal[i-1][j] +pascal[i-1][j-1];


} 

void pascalprint(int n){
	int i,j;
	
	for(i=0;i<n;i++){
		for(j=0;j<=i;j++){
			if(j!=0)
				cout<<' ';
			cout<<pascal[i][j];
		}
		cout<<endl;
	}
}
int main(){
	int n;
	
    pascalgo(30);

	while(cin>>n){
		pascalprint(n);
		cout<<endl;
	}
}