#include<iostream>
using namespace std;
int M,N,a[30][30],x[100],y[100];
int x0,y0,x1,y1,id;
int go(int n,int m)
{
if(n>N-1||m>M-1)return 0;
if(n==x1-1&&m==y1-1)return 1;
if(a[n+1][m]==0)
{
a[n+1][m]=1;
if(go(n+1,m))
{
x[id]=n+1;
y[id]=m;
id++;
return 1;
// cout<<"("<<n+1<<","<<m<<")"<<" ";return 1;
}//下走
a[n+1][m]=0;
}
if(a[n][m+1]==0)
{
a[n][m+1]=1;
if(go(n,m+1))
{
x[id]=n;
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余3页未读,立即下载