Pagini recente » Cod sursa (job #1637185) | Cod sursa (job #439150) | Cod sursa (job #2502779) | Cod sursa (job #1183286) | Cod sursa (job #1127347)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
char q[101];
int n,m,i,j,ri,rj,ji,jj;
short l[101][101];
short c[100][2],cj[101][2],sr,sj;
short d[]={-1,0,1,0};
short e[]={0,-1,0,1};
void citire()
{ ifstream f("rj.in");
f>>n>>m;
for(i=1;i<=n;i++)
{f.get();f.get(q,101);
for(j=1; j<=m;j++)
{
if(q[j-1] =='X' ) l[i][j]=-1;
if(q[j-1] ==' ' ) l[i][j]=0;
if(q[j-1] =='R' ) {ri=i;rj=j;}
if(q[j-1] =='J' ) {ji=i;jj=j;}
}}}
ofstream g("rj.out");
void afis()
{
for(i=1;i<=n;i++) { for(j=1;j<=m;j++)
g<<l[i][j]<<" ";
g<<endl;
} }
int valid(int li, int co )
{ return li>0 && co>0 && li<=n && co<=m &&l[li][co]==0;}
void adaur(int x, int y)
{ sr++; c[sr][0]=x;c[sr][1]=y;}
void adauj(int x, int y)
{ sj++; cj[sj][0]=x;cj[sj][1]=y;}
int main()
{ citire();afis();
adaur(ri,rj);
adauj(ji,jj);
//int le=0;
//while( c[le][0] != cj[le][0] && c[le][1] != cj[le][1] )
// { if(valid(le))
//}
cout << "Hello world!" << endl;
return 0;
}