Go: package main

import (
	"fmt"
	"math"
)

type Position struct {
	X int64
	Y int64
}

func (one Position) Distance(another Position) int64 {
	return int64(math.Abs(float64(one.X-another.X)) + math.Abs(float64(one.Y-another.Y)))
}

type PersonPosition struct {
	Takayuki Position
	Kazuyuki Position
}

func (one PersonPosition) Distance() int64 {
	return one.Takayuki.Distance(one.Kazuyuki)
}

type Status struct {
	Person PersonPosition
	Turn   int64
}

type PQStatus []*Status

func solve(h, w int64) {
	var tx, ty, kx, ky int64
	fmt.Scan(&tx, &ty, &kx, &ky)
	tx--
	ty--
	kx--
	ky--
	m := make([][]int64, h)
	for i := range m {
		m[i] = make([]int64, w)
		for j := int64(0); j < w; j++ {
			fmt.Scan(&m[i][j])
		}
	}
	start := &Status{Person: PersonPosition{Takayuki: Position{X: tx, Y: ty}, Kazuyuki: Position{X: kx, Y: ky}}, Turn: 0}
	pq := make(PQStatus, 0)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(102)
	for len(pq) > 0 {
		now := &Status{}
		*now = *pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}

		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = now.Turn

		for i := 0; i < 4; i++ {
			next := &Status{}
			*next = *now
			next.Person.Kazuyuki.X += dx[i]
			next.Person.Kazuyuki.Y += dy[i]
			if next.Person.Kazuyuki.X < 0 || next.Person.Kazuyuki.X >= w ||
				next.Person.Kazuyuki.Y < 0 || next.Person.Kazuyuki.Y >= h ||
				m[next.Person.Kazuyuki.Y][next.Person.Kazuyuki.X] == 1 {
				next.Person.Kazuyuki.X -= dx[i]
				next.Person.Kazuyuki.Y -= dy[i]
			}
			next.Person.Takayuki.X -= dx[i]
			next.Person.Takayuki.Y -= dy[i]
			if next.Person.Takayuki.X < 0 || next.Person.Takayuki.X >= w ||
				next.Person.Takayuki.Y < 0 || next.Person.Takayuki.Y >= h ||
				m[next.Person.Takayuki.Y][next.Person.Takayuki.X] == 1 {
				next.Person.Takayuki.X += dx[i]
				next.Person.Takayuki.Y += dy[i]
			}
			next.Turn++
			if next.Turn <= 100 {
				pq = append(pq, next)
			}
		}
	}
	if ans == 102 {
		fmt.Println("NA")
	} else {
		fmt.Println(ans)
	}
}

func main() {
	var h, w int64
	for {
		fmt.Scan(&h, &w)
		if h == 0 && w == 0 {
			break
		}
		solve(h, w)
	}
}

C++: #include<iostream>
#include<queue>
#include<map>
using namespace std;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
class state {
public:
	int tx;
	int ty;
	int kx;
	int ky;
	bool operator < (const state &s)const {
		if (ty != s.ty)return ty < s.ty;
		if (tx != s.tx)return tx < s.tx;
		if (ky != s.ky)return ky < s.ky;
		if (kx != s.kx)return kx < s.kx;
		return false;
	}
};
int main() {
	while (true) {
		int W, H;
		cin >> W >> H;
		if (W == 0 && H == 0)
			break;
		int d[52][52];
		for (int i = 0; i < H + 2; i++) {
			for (int j = 0; j < W + 2; j++) {
				d[i][j] = 1;
			}
		}
		state num;
		cin >> num.tx >> num.ty >> num.kx >> num.ky;
		for (int i = 1; i < H + 1; i++) {
			for (int j = 1; j < W + 1; j++) {
				cin >> d[i][j];
			}
		}
		queue<state> q;
		q.push(num);
		map<state, int> m;
		m[num] = 0;
		while (true) {
			num = q.front();
			q.pop();
			if (m[num] >= 100) {
				cout << "NA" << endl;
				break;
			}
			if (num.tx == num.kx && num.ty == num.ky) {
				cout << m[num] << endl;
				break;
			}
			for (int i = 0; i < 4; i++) {
				state copy = num;
				if (d[copy.ty + dy[i]][copy.tx + dx[i]] == 0) {
					copy.ty += dy[i];
					copy.tx += dx[i];
				}
				if (d[copy.ky - dy[i]][copy.kx - dx[i]] == 0) {
					copy.ky -= dy[i];
					copy.kx -= dx[i];
				}
				if (m.find(copy)==m.end()) {
					q.push(copy);
					m[copy] = m[num]+1;
				}
			}
			if (q.empty()) {
				cout << "NA" << endl;
				break;
			}
		}
		m.clear();
		while (!q.empty()) {
			q.pop();
		}
	}
	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define INF (2000000000)
#define MOD (1000000007)
using namespace std;

typedef vector<int> VI;
typedef vector<int>::iterator VII;
typedef vector<double> VD;
typedef vector<double>::iterator VDI;
typedef pair<int, int> P;


typedef struct
{
	int tx, ty, kx, ky;
} POS;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};

int maze[100][100];
int X, Y;
POS f;
int d[55][55][55][55];

int search()
{
	queue<POS> que;
	
	for (int i = 0; i < 55; i++){
		for (int j = 0; j < 55; j++){
			for (int k = 0; k < 55; k++){
				for (int l = 0; l < 55; l++){
					d[i][j][k][l] = INF;
				}
			}
		}
	}
	
	que.push(f);
	d[f.tx][f.ty][f.kx][f.ky] = 0;
	
	while (que.size()){
		POS now = que.front();
		que.pop();
		
		//printf("%d %d %d %d\n", now.tx, now.ty, now.kx, now.ky);
		
		if (now.tx == now.kx && now.ty == now.ky){
			return (d[now.tx][now.ty][now.kx][now.ky]);
		}
		
		for (int i = 0; i < 4; i++){
			POS to;
			if (maze[now.tx + dx[i]][now.ty + dy[i]] && maze[now.kx - dx[i]][now.ky - dy[i]]){
				continue;
			}
			
			if (maze[now.tx + dx[i]][now.ty + dy[i]]){
				to.tx = now.tx;
				to.ty = now.ty;
			}
			else {
				to.tx = now.tx + dx[i];
				to.ty = now.ty + dy[i];
			}
			
			if (maze[now.kx - dx[i]][now.ky - dy[i]]){
				to.kx = now.kx;
				to.ky = now.ky;
			}
			else {
				to.kx = now.kx - dx[i];
				to.ky = now.ky - dy[i];
			}
			
			to.tx = now.tx + dx[i];
			to.ty = now.ty + dy[i];
			to.kx = now.kx - dx[i];
			to.ky = now.ky - dy[i];
			
			//printf("%d %d %d %d\n", to.tx, to.ty, to.kx, to.ky);
			
			if (d[to.tx][to.ty][to.kx][to.ky] == INF && d[now.tx][now.ty][now.kx][now.ky] < 100){
				que.push(to);
				d[to.tx][to.ty][to.kx][to.ky] = d[now.tx][now.ty][now.kx][now.ky] + 1;
			}
		}
	}
	
	return (-1);
}

int main()
{
	while (scanf("%d %d", &X, &Y), X + Y){
		scanf("%d %d", &f.tx, &f.ty);
		scanf("%d %d", &f.kx, &f.ky);
		
		for (int i = 0; i < 100; i++){
			for (int j = 0; j < 100; j++){
				maze[i][j] = 1;
			}
		}
		
		for (int i = 1; i <= Y; i++){
			for (int j = 1; j <= X; j++){
				scanf("%d", &maze[j][i]);
			}
		}
		
		//for (int i = 0; i <= Y + 1; i++){
		//	for (int j = 0; j <= X + 1; j++){
		//		printf("%d ", maze[j][i]);
		//	}
		//	puts("");
		//}
		
		int r = search();
		if (r != -1) printf("%d\n", r);
		else puts("NA");
	}
	
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

const int inf = 999999;

struct P{
	int x;
	int y;
};

struct St{
	P tk;
	P kz;
	int cost;
};

int xdir[4] = {0, 1, 0, -1}, ydir[4] = {1, 0, -1, 0};

int bfs(char a[51][51], int w, int h, P p, P q)
{
	int r = inf;
	bool vis[51][51][51][51];
	fill(&vis[0][0][0][0], &vis[50][50][50][50], true);
	St s, t;
	queue<St> que;
	s.tk = p;
	s.kz = q;
	s.cost = 0;
	que.push(s);
	
	while(!que.empty()){
		s = que.front();
		que.pop();
		if(s.tk.x == s.kz.x && s.tk.y == s.kz.y){
			r = s.cost;
			break;
		}
		if(s.cost >= 100){
			break;
		}
		
		for(int i = 0; i < 4; i++){
			int tx = s.tk.x+xdir[i], ty = s.tk.y+ydir[i];
			int kx = s.kz.x-xdir[i], ky = s.kz.y-ydir[i];
			if(0 <= tx && tx < w && 0 <= ty && ty < h && 0 <= kx && kx < w && 0 <= ky && ky < h){
				if(a[ty][tx] == '0' && a[ky][kx] == '0' && vis[ty][tx][ky][kx]){
					vis[ty][tx][ky][kx] = false;
					t.tk.x = tx;
					t.tk.y = ty;
					t.kz.x = kx;
					t.kz.y = ky;
					t.cost = s.cost+1;
					que.push(t);
				}
			}
		}
	}
	
	return r;
}

int main()
{
	int w, h, r;
	char a[51][51];
	P p, q;
	
	while(cin>>w>>h && (w+h)){
		cin >> p.x >> p.y;
		cin >> q.x >> q.y;
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				cin >> a[i][j];
			}
		}
		
		r = bfs(a, w, h, p, q);
		if(r == inf){
			cout << "NA" << endl;
		} else {
			cout << r << endl;
		}
	}
	
	return 0;
}