希望更丰富的展现？使用Markdown
```
include<bits/stdc++.h>
using namespace std;
long long pd(long long bj)
{
if (bj==-1)
{
return 0;
}
return bj;
}
int main()
{
long long a[105][105]= {0};
int n,m,x,y,i,j;
a[0][0]=1;
cin>>n>>m>>x>>y;
for (int i=1; i<=n; i++)
{
a[i][0]=1;
}
for (int i=1; i<=m; i++)
{
a[0][i]=1;
}
if (x>=0&&x<=n&&y>=0&&y<=m)
{
a[x][y]=-1;
}
if (x-2>=0&&y-1>=0)
{
a[x-2][y-1]=-1;
}
if (x-2>=0&&y+1<=m)
{
a[x-2][y+1]=-1;
}
if (x-1>=0&&y-2>=0)
{
a[x-1][y-2]=-1;
}
if (x-1>=0&&y+2<=m)
{
a[x-1][y+2]=-1;
}
if (x+1<=n&&y-2>=0)
{
a[x+1][y-2]=-1;
}
if (x+1<=n&&y+2<=m)
{
a[x+1][y+2]=-1;
}
if (x+2<=n&&y-1>=0)
{
a[x+2][y-1]=-1;
}
if (x+2<=n&&y+1<=m)
{
a[x+2][y+1]=-1;
}
for (int i=0; i<=n; i++)
{
for (int j=0; j<=m; j++)
{
cout<<setw(3)<<a[i][j]<<" ";
}
cout<<endl;
}
cout<<endl;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=m; j++)
{
if (a[i][j]!=-1)
{
a[i][j]=pd(a[i-1][j])+pd(a[i][j-1]);
}
}
}
for (int i=0; i<=n; i++)
{
for (int j=0; j<=m; j++)
{
cout<<setw(3)<<a[i][j]<<" ";
}
cout<<endl;
}
cout<<a[n][m]<<endl;
return 0;
}
```
by __gcd @ 2019-05-23 22:35:53