线性dp
两个月前不会的dp,现在终于会了
#include "bits/stdc++.h"
using namespace std;
const int N = 35;
int f[N][N];
int n, m;
int main() {
cin >> n >> m;
f[1][1] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i == 1 && j == 1) continue;//跳过起点
if ((i % 2 == 0) && (j % 2 == 0)) continue;
f[i][j] = f[i - 1][j] + f[i][j - 1];
}
}
cout << f[n][m] << '\n';
return 0;
}