经典面试题——从矩阵的左上角到右下角有多少种方法。

不多说，代码献上，三种方法
#include <iostream>
using namespace std;

int mat[11][11];
int dp[11];

int main()
{
	int n, m;
	int i, j;
	//朴素DP
	for(i = 1; i <= 10; ++i){
		mat[1][i] = mat[i][1] = 1;
	}

	for(i = 2; i <= 10; ++i){
		for(j = 2; j <= 10; ++j){
			mat[i][j] = mat[i-1][j] + mat[i][j - 1];
		}
	}
	//--------------------
	while(scanf("%d %d", &n, &m) != EOF){
		//滚动数组
		if(n < m){
			n = n^m;
			m = n^m;
			n = n^m;
		}

		for(i = 1; i <= n; ++i){
			dp[i] = 1;
		}
		for(i = 2; i <= m; ++i){
			for(j = 2; j <= n; ++j){
				dp[j] += dp[j - 1];
			}
		}
		//------------------------------
		printf("%d %d\n", mat[n][m], dp[n]);//结论应该为combo(n+m,min(n,m))
	}
	return 0;
}