Pagini recente » Cod sursa (job #1146206) | Cod sursa (job #1810547) | Cod sursa (job #1290860) | Cod sursa (job #2397851) | Cod sursa (job #1878736)
#include<iostream>
#include<fstream>
#include<cstring>
using namespace std;
fstream fin("rj.in",ios::in), fout("rj.out",ios::out);
char q[105][105];
pair<int,int>R;
pair<int,int>J;
priority_queue<pair<int,pair<int,int> > >D;
int n,m,p[105][105];
int di[]={-1,0,1,0}, dj[]={0,1,0,-1};
void parc(pair<int,int>x)
{
int c;
for(c=0;c<)
}
int main()
{
int i,j;
fin>>n>>m;
fin.get();
for(i=0;i<n;i++)
{
fin.getline(q[i],105);
}
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(q[i][j]=='X')
{
p[i][j]=-1;
}
if(q[i][j]=='R')
{
p[i][j]=1;
R.first=i;
R.second=j;
}
if(q[i][j]=='J')
{
p[i][j]=1;
J.first=i;
J.second=j;
}
}
}
parc(R);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
fout<<p[i][j]<<" ";
}
fout<<"\n";
}
}