题目描述
blablabla
样例
blablabla
算法1:动态规划
C++ 代码
//动态规划
#include<bits/stdc++.h>
using namespace std;
int dp[31][31];
bool f[31][31];
int n, m;
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (!(i % 2 == 0 && j % 2 == 0))
f[i][j] = 1;
// 初始化
dp[1][1] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (!(i == 1 && j == 1) && !(i % 2 == 0 && j % 2 == 0))
dp[i][j] = f[i - 1][j] * dp[i - 1][j] + f[i][j - 1] * dp[i][j - 1];
cout << dp[n][m] << endl;
return 0;
}