Pagini recente » Cod sursa (job #3031449) | Cod sursa (job #2329966) | Cod sursa (job #160502) | Cod sursa (job #1210381) | Cod sursa (job #546057)
Cod sursa(job #546057)
#include <fstream>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
const int id[] = { -1, 0, 1, 1, 1, 0, -1, -1},
jd[] = { 1, 1, 1, 0, -1, -1, -1 };
char a[100][100];
int n, m;
int Lr[10001];
int Cr[10001];
int Lj[10001];
int Cj[10001];
int b[100][100];
int ipr, jpr, ipj, jpj;
void Read();
int Vecin(int i, int j, int v )
void LEE();
int main()
{
Read();
LEE();
fin.close();
fout.close();
}
int Vecin(int i, int j, int v)
{
for ( int k = 0; k < 4; k++ )
if ( a[i+di[k]][j+dj[k]] == v )
return 1;
return 0;
}
void Read()
{
fin >> n >> m;
for ( int i = 0; i < n; i++ )
for ( int j = 0; j < m; j++ )
{
char c;
fin >> c;
a[i][j] = c;
if ( a[i][j] == 'R' )
{
Lr[0] = i;
Cr[0] = j;
}
if ( a[i][j] == 'J' )
{
Lj[0] = i;
Cj[0] = j;
}
}
}
void LEE()
{
int st, dr;
}