C++动态规划法计算组合数

//动态规划法求解组合数
/*
#include<iostream>
using namespace std;
#define MaxSize 100
int C[MaxSize][MaxSize+1];


int combinat(int m, int n)
{
	for(int i=0;i<m;i++)
		for (int j = 0;j <= i+1;j++)
		{
			if (i + 1 == j || j == 0)C[i][j] = 1;
			else C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
		}
	return C[m-1][n];
}

int main()
{
	for (int m = 1;m <= MaxSize;m++)
	{
		C[m-1][m] = 1;
		C[m-1][0] = 1;
	}
	cout << combinat(3, 2) << endl;
	getchar();

}
*/