Pagini recente » Clasamentul arhivei de probleme | Cod sursa (job #347417) | Cod sursa (job #1516127) | Borderou de evaluare (job #1567271) | Cod sursa (job #139381)
Cod sursa(job #139381)
#include<fstream.h>
#include<string.h>
#include<stdlib.h>
ifstream fin("rj.in");
ofstream fout("rj.out");
int n,m,i,j,k,pas,a[50][50],b[50][50],cont,pozi,pozj,boo=1;
int c1[8]={-1,-1,-1,0,0,1,1,1},c2[8]={-1,0,1,-1,1,-1,0,1};
char c;
int OK(int i, int j)
{
if(i>=1&&i<=n&&j>=1&&j<=m) return 1;
return 0;
}
int main()
{ fin>>n>>m;
for(i=1;i<=n;i++)
for(j=0; j<=m; j++ )
{ c=fin.get(); if(c=='R'||c=='J') b[i][j]=1; if(c=='X') b[i][j]=-1; if(c==' ') b[i][j]=0; }
pas=1;
while(boo)
{ boo=0;
for(i=1; i<=n; i++)
for(j=1;j<=m;j++)
if(b[i][j]==pas)
for(k=0; k<8; k++)
if( OK(i+c1[k],j+c2[k]) )
if( b[i+c1[k]][j+c2[k]]==pas+1 )
{ pozi=i+c1[k]; pozj=j+c2[k]; cont=b[pozi][pozj]; }
else if(b[i+c1[k]][j+c2[k]]==0) { b[i+c1[k]][j+c2[k]]=pas+1; boo=1; }
pas++;
}
fout<<cont<<" "<<pozi<<" "<<pozj;
for(int h=1;h<=n;h++)
{ fout<<"\n";
for(int t=1; t<=m; t++)
fout<<b[h][t]<<" ";
}
return 0;
}