不开longlong见祖宗
by lndjy @ 2020-02-03 07:31:49
@[玩得开心](/user/271629) 这道题用dp再开个unsigned long long轻松过，显然~~水题~~；
```cpp
#include<cstdio>
#include<iostream>
#define ull unsigned long long
using namespace std;
int dpx[9]={0,-2,-1,1,2,2,1,-1,-2};
int dpy[9]={0,1,2,2,1,-1,-2,-2,-1};
ull dp[31][31];
bool vis[31][31];
int main(){
int bx,by,mx,my;
scanf("%d%d%d%d",&bx,&by,&mx,&my);
bx++;
by++;
mx++;
my++;
dp[1][1]=1;
vis[mx][my]=1;
for(int i=1;i<=8;++i) vis[mx+dpx[i]][my+dpy[i]]=1;
for(int i=1;i<=bx;++i)
for(int j=1;j<=by;++j){
if(vis[i][j]==1) continue;
dp[i][j]=max(dp[i][j],dp[i-1][j]+dp[i][j-1]);
}
cout<<dp[bx][by];
return 0;
}
```
拿去不谢
by DOs__lx @ 2020-02-07 13:36:59