2010-04-16 - DATA STRUCTURE BODLOGO BIE DAALTANDAA ASHIGLAARAI
#include
#include
#include
/*#include*/
/*#include*/
int i1,i,j,j1,i2,j2,n,m,f;
int a[21][21];
FILE*p;
int nuudel(int x,int y, int k)
{
if(x+1<=n&&(a[x+1][y]==0)){ a[x+1][y]=k+1;
nuudel(x+1,y,k+1);
a[x+1][y]=0;
}
if(x-1>0&&(a[x-1][y]==0)){ a[x-1][y]=k+1;
nuudel(x-1,y,k+1);
a[x-1][y]=0;
}
if(y+1<=m&&(a[x][y+1]==0)){ a[x][y+1]=k+1;
nuudel(x,y+1,k+1);
a[x][y+1]=0;
}
if(y-1>0&&(a[x][y-1]==0...
#include
#include
/*#include
/*#include
int i1,i,j,j1,i2,j2,n,m,f;
int a[21][21];
FILE*p;
int nuudel(int x,int y, int k)
{
if(x+1<=n&&(a[x+1][y]==0)){ a[x+1][y]=k+1;
nuudel(x+1,y,k+1);
a[x+1][y]=0;
}
if(x-1>0&&(a[x-1][y]==0)){ a[x-1][y]=k+1;
nuudel(x-1,y,k+1);
a[x-1][y]=0;
}
if(y+1<=m&&(a[x][y+1]==0)){ a[x][y+1]=k+1;
nuudel(x,y+1,k+1);
a[x][y+1]=0;
}
if(y-1>0&&(a[x][y-1]==0...
