Dynamic Programming Binomial Coefficient의 구현

int bin(int n, int k)
{
	int **B;
	B = new int*[n+1];
	for(int i=0 ; i<=n ; i++)
	{
		B[i] = new int[k+1];
	}

	for(int i=0 ; i<=n ; i++) 
	{
		for (int j=0 ; j<= i ; j++)
		{
			if(j==0 || j==i) 
			{
				B[i][j]=1;
			}
			else
			{
				B[i][j]=B[i-1][j-1] + B[i-1][j];
			}
		}
	}
	return B[n][k];
}