溢出了吧
by huayucaiji @ 2020-06-25 14:03:00
如果不是死循环（大雾）
by huayucaiji @ 2020-06-25 14:03:13
> for (int k = 0; k < 8; i++)
by Inorganic_Chemistry @ 2020-06-25 14:21:21
@[cuixingji](/user/349906)
by Inorganic_Chemistry @ 2020-06-25 14:21:39
k++
by IceYukino @ 2020-06-25 14:22:51
@[cuixingji](/user/349906) 想问您测样例了吗？
by liqingyang @ 2020-06-25 14:34:13
~~大佬眼力好好~~
by liqingyang @ 2020-06-25 14:34:22
谢啦
我是个蒟蒻嗯
by Wildcxj @ 2020-06-25 16:57:35
```cpp
#include<iostream>
#include<algorithm>
using namespace std;
bool vis[22][22];
int bx, by, mx, my;
int fx[8] = {-2, -1, 1, 2, 2, 1, -1, -2 };
int fy[8] = {1, 2, 2, 1, -1, -2, -2, -1 };
int f[22][22];
int main()
{
cin >> bx >> by >> mx >> my;
for (int i = 0; i <=bx; i++)
{
for (int j = 0; j <= by; j++)
{
vis[i][j] = true;
for (int k = 0; k < 8; k++)
{
if (bx + fx[k] == mx && by + fy[k] == my)
{
vis[i][j] = false;
}
}
}
}
f[2][2] = 1;
for (int i = 2; i <= bx+2; i++)
{
for (int j = 2; j <= by+2; j++)
{
if(vis[i-2][j-2])
{
f[i][j] = max(f[i][j], f[i - 1][j] + f[i][j - 1]);
}
}
}
cout << f[bx + 2][by + 2];
}
```
全程wa了
by Wildcxj @ 2020-06-25 16:59:46
成
by Wildcxj @ 2020-06-25 16:59:54