题解 | #走方格的方案数#

// HJ91-2 走方格的方案数.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
#include<iostream>
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define N 8

int dp[N][N];

int main()
{
	int m, n;
	while (cin >> m >> n)
	{
		memset(dp, 0, sizeof(dp));
		dp[0][0] = 1;
		for (int i = 0; i <= m; i++)
		{
			dp[i][0] = 1;
		}
		for (int i = 0; i <= n; i++)
		{
			dp[0][i] = 1;
		}
		for (int i = 1; i <= m; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
			}
		}
		cout << dp[m][n] << endl;
	}
	return 0;
}