파스칼삼각형/송지원

#include <iostream>
using namespace std;

void pasTri(int);
int combination(int, int);
int factorial(int);

void main(){
	int num;
	cout << "몇��� ������������?";
	cin >> num;
	pasTri(num-1);
}


void pasTri(int num){
	for(int i=0; i<=num; i++){
		for(int j=0; j<=i; j++){
			cout << combination(i, j) << " " ;
		}
	cout << endl;
	}	
}

int combination(int n, int r){
	int result = factorial(n) / (factorial(r) * factorial(n-r));
	return result;
}

int factorial(int n){
	if(n<=1)
		return 1;
	else
		return n * factorial(n-1);
}