#include<iostream>
#include<queue>
#include<stack>
#include<cstdlib>
#include<cstring>
int g = 0;
using namespace std;
int maze[5][5];
int visited[30];
struct node
{
int x;
int y;
int mintime;
int g;
node(){}
node(int a,int b,int c,int d)
{
x = a;
y = b;
mintime = c;
g = d;
}
};
queue<node> h;
stack<node> hh;
int main()
{
for (int i = 0; i < 5;i++)
for (int j = 0; j < 5; j++)
cin >> maze[i][j];
node x[30];
memset(x, 0, sizeof(x));
memset(visited, 0, sizeof(visited));
node r(0, 0, 0,-1);
x[0] = r;
h.push(r);
visited[r.x * 5 + r.y] = 1;
while (!h.empty())
{
node k = h.front();
if (k.x == 4 && k.y == 4)
{
node u = x[k.x*5+k.y];
for (u; u.g>= 0; u = x[u.g])
hh.push(u);
node kk(0, 0, 0, -1);
hh.push(kk);
for (node p4; !hh.empty(); hh.pop())
{
p4 = hh.top();
cout << "(" << p4.x << "," << p4.y << ")" << endl;
}
break;
}
else
{
if (k.x + 1 <= 4 &&maze[k.x+1][k.y]==0 &&visited[(k.x + 1)*5+k.y]==0)
{
node v(k.x + 1, k.y, k.mintime + 1,k.x*5+k.y);
x[(k.x + 1)*5 + k.y] = v;
visited[(k.x + 1)*5+k.y] = 1;
h.push(v);
}
if (k.x-1 >= 0 && !maze[k.x-1][k.y] && !visited[(k.x -1)*5+k.y])
{
node m(k.x - 1, k.y, k.mintime + 1, k.x * 5 + k.y);
x[(k.x-1) * 5 + k.y] = m;
visited[(k.x-1)*5+k.y] = 1;
h.push(m);
}
if (k.y + 1 <= 4 && !maze[k.x][k.y+1] && !visited[k.x*5+(k.y+1)])
{
node l(k.x, k.y+1, k.mintime + 1,k.x*5+k.y);
x[k.x* 5 + k.y+1] = l;
visited[(k.y + 1)+5*k.x] = 1;
h.push(l);
}
if (k.y -1 >= 0 && !maze[k.x][k.y-1] && !visited[(k.y-1)+5*k.x])
{
node p(k.x, k.y-1, k.mintime + 1,k.x*5+k.y);
x[k.x * 5 + k.y-1] = p;
visited[(k.y-1)+5*k.x] = 1;
h.push(p);
}
h.pop();
}
}
}
#include<queue>
#include<stack>
#include<cstdlib>
#include<cstring>
int g = 0;
using namespace std;
int maze[5][5];
int visited[30];
struct node
{
int x;
int y;
int mintime;
int g;
node(){}
node(int a,int b,int c,int d)
{
x = a;
y = b;
mintime = c;
g = d;
}
};
queue<node> h;
stack<node> hh;
int main()
{
for (int i = 0; i < 5;i++)
for (int j = 0; j < 5; j++)
cin >> maze[i][j];
node x[30];
memset(x, 0, sizeof(x));
memset(visited, 0, sizeof(visited));
node r(0, 0, 0,-1);
x[0] = r;
h.push(r);
visited[r.x * 5 + r.y] = 1;
while (!h.empty())
{
node k = h.front();
if (k.x == 4 && k.y == 4)
{
node u = x[k.x*5+k.y];
for (u; u.g>= 0; u = x[u.g])
hh.push(u);
node kk(0, 0, 0, -1);
hh.push(kk);
for (node p4; !hh.empty(); hh.pop())
{
p4 = hh.top();
cout << "(" << p4.x << "," << p4.y << ")" << endl;
}
break;
}
else
{
if (k.x + 1 <= 4 &&maze[k.x+1][k.y]==0 &&visited[(k.x + 1)*5+k.y]==0)
{
node v(k.x + 1, k.y, k.mintime + 1,k.x*5+k.y);
x[(k.x + 1)*5 + k.y] = v;
visited[(k.x + 1)*5+k.y] = 1;
h.push(v);
}
if (k.x-1 >= 0 && !maze[k.x-1][k.y] && !visited[(k.x -1)*5+k.y])
{
node m(k.x - 1, k.y, k.mintime + 1, k.x * 5 + k.y);
x[(k.x-1) * 5 + k.y] = m;
visited[(k.x-1)*5+k.y] = 1;
h.push(m);
}
if (k.y + 1 <= 4 && !maze[k.x][k.y+1] && !visited[k.x*5+(k.y+1)])
{
node l(k.x, k.y+1, k.mintime + 1,k.x*5+k.y);
x[k.x* 5 + k.y+1] = l;
visited[(k.y + 1)+5*k.x] = 1;
h.push(l);
}
if (k.y -1 >= 0 && !maze[k.x][k.y-1] && !visited[(k.y-1)+5*k.x])
{
node p(k.x, k.y-1, k.mintime + 1,k.x*5+k.y);
x[k.x * 5 + k.y-1] = p;
visited[(k.y-1)+5*k.x] = 1;
h.push(p);
}
h.pop();
}
}
}