Files
python/TangDou/Dfs/DFS8_Robot.cpp
HuangHai 1f397eca87 'commit'
2025-08-30 18:35:01 +08:00

24 lines
445 B
C++

#include <bits/stdc++.h>
using namespace std;
int m, n;
int dx[] = {0, 1};
int dy[] = {1, 0};
int cnt;
void dfs(int x, int y) {
if (x == m && y == n) {
cnt++;
return;
}
for (int i = 0; i < 2; i++) {
int tx = x + dx[i], ty = y + dy[i];
if (tx <= m && ty <= n)
dfs(tx, ty);
}
}
int main() {
cin >> m >> n;
dfs(1, 1);
printf("%d", cnt);
return 0;
}