AcWing 2067. 走方格
原题链接
简单
作者:
叙利亚悍匪_0
,
2024-04-04 09:43:16
,
所有人可见
,
阅读 1
暴力dfs 能拿90分
#include<iostream>
using namespace std;
const int N = 35;
int a[N][N];
int n,m;
int dx[2] = {1,0};
int dy[2] = {0,1};
int ans;
void dfs(int x,int y)
{
if(x % 2 == 0 && y % 2 == 0) return;
if( x == n && y == m)
{
ans++;
return;
}
for(int i = 0;i<2;i++)
{
int newx = x + dx[i],newy = y + dy[i];
if(newx <= 0 || newx > n || newy > m || newy <= 0) continue;
dfs(newx,newy);
}
}
int main()
{
cin>>n>>m;
dfs(1,1);
cout<<ans<<endl;
}