Pagini recente » Cod sursa (job #2068089) | Cod sursa (job #1891895) | Cod sursa (job #686654) | Cod sursa (job #2383249) | Cod sursa (job #503942)
Cod sursa(job #503942)
#include<fstream.h>
int xx[9]={0,-1,-1,-1,0,0,1,1,1},yy[9]={0,-1,0,1,-1,1,-1,0,1},a[102][102];
int main ()
{
FILE *f=fopen("rj.in","r");
ofstream fcout("rj.out");
int n,m,i,j,ci[10000],cj[10000],xj,yj,p,u,z;
char x;
fscanf(f,"%d",&n);fscanf(f,"%d",&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{fscanf(f,"%c",&x);
if(x==' ')a[i][j]=-2;
else if(x=='X')a[i][j]=-1;
else if(x=='R'){ci[1]=i;cj[1]=j;a[i][j]=1;}
else if(x=='J'){xj=i;yj=j;a[i][j]=-2;}
else if(x=='\n')j--;}
p=1;u=1;
while(p<=u)
{if(ci[p]==xj&&cj[p]==yj)break;
for(i=1;i<=8;i++)
if(a[ci[p]+xx[i]][cj[p]+yy[i]]==-2){a[ci[p]+xx[i]][cj[p]+yy[i]]=a[ci[p]][cj[p]]+1;ci[++u]=ci[p]+xx[i];cj[u]=cj[p]+yy[i];}
p++;}
z=a[xj][yj]/2+a[xj][yj]%2;
fcout<<z<<' ';
while(a[xj][yj]!=z)
for(i=1;i<=8;i++)
if(a[xj+xx[i]][yj+yy[i]]+1==a[xj][yj]){xj=xj+xx[i];yj=yj+yy[i];break;}
fcout<<xj<<' '<<yj<<'\n';
return 0;
}