@[him0715](/user/705879) 深搜百分之百会超时啊！
by bobi0577 @ 2023-05-05 19:56:08
建议**动态规划**
```
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a[32][32];
cin>>n>>m;
memset(a,0,sizeof(a));
a[0][0]=1;
for(int i=1;i<=m;i++)
for (int j=0;j<n;j++){
if (j == 0) a[i][j]=a[i-1][n-1]+a[i-1][j+1];
else if (j == n - 1) a[i][j]=a[i-1][j-1]+a[i-1][0];
else a[i][j]=a[i-1][j-1]+a[i-1][j+1];
}
cout<<a[m][0];
return 0;
}
by zhongchengxi @ 2023-08-05 17:27:15
递推
by JI_CI @ 2023-08-12 19:42:48