2067.走方格

思路

代码

#include <bits/stdc++.h>

using namespace std;

const int N = 55;

int n, m;
int f[N][N];

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 || j % 2) {
                f[i][j] = f[i - 1][j] + f[i][j - 1];
            }
        }
    }
    cout << f[n][m] << endl;
    
    return 0;
}