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 (pq PQStatus) Len() int {
	return len(pq)
}
func (pq PQStatus) Less(i, j int) bool {
	if pq[i].Turn == pq[j].Turn {
		return pq[i].Person.Distance() < pq[j].Person.Distance()
	}
	return pq[i].Turn < pq[j].Turn
}

func (pq PQStatus) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PQStatus) Push(x interface{}) {
	item := x.(*Status)
	*pq = append(*pq, item)
}

func (pq *PQStatus) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	*pq = old[0 : n-1]
	return item
}

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)
	//heap.Init(&pq)
	//heap.Push(&pq, start)
	//pq.Push(start)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(101)
	for pq.Len() > 0 {
		//now := heap.Pop(&pq).(*Status)
		//now := pq.Pop().(*Status)
		now := pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			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 += 1
			if next.Turn < 100 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				pq = append(pq, next)
			}
		}
	}
	if ans == 101 {
		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<queue>
#include<stdio.h>

using namespace std;

class T{
	public:
	int x1,x2,y1,y2,count;
	T(int x1,int y1,int x2,int y2,int count):x1(x1),y1(y1),x2(x2),y2(y2),count(count){}
};

char check[55][55][55][55];
int board[55][55];

int main(){
	while(1){
		for(int i=0;i<55;i++){
			for(int j=0;j<55;j++){
				for(int k=0;k<55;k++){
					for(int p=0;p<55;p++){
						check[i][j][k][p]=0;
					}
				}
			}
		}
		
		int w,h;
		int sx1,sx2,sy1,sy2;
		
		scanf("%d%d",&w,&h);
		if(w==0 && h==0)break;
		
		scanf("%d%d%d%d",&sx1,&sy1,&sx2,&sy2);
		
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				scanf("%d",&board[i][j]);
			}
		}
		
		
		queue<T> que;
		que.push(T(sx1,sy1,sx2,sy2,0));
		
		while(1){
			if(que.empty())break;
			
			T u = que.front();
			que.pop();
			
			if(check[u.x1][u.y1][u.x2][u.y2]==1)continue;
			check[u.x1][u.y1][u.x2][u.y2]=1;
			
			if(u.count>=100)break;
			if(u.x1 == u.x2 && u.y1 == u.y2){
				printf("%d\n",u.count);
				goto A;
			}
			
			int dx[4] = {0,1,0,-1};
			int dy[4] = {1,0,-1,0};
			for(int i=0;i<4;i++){
				int nx1 = u.x1 + dx[i];
				int ny1 = u.y1 + dy[i];
				
				int nx2 = u.x2 - dx[i];
				int ny2 = u.y2 - dy[i];
				
				if(nx1<0 || ny1<0 || nx1>=w || ny1>=h || board[ny1][nx1]==1){
					nx1=u.x1;
					ny1=u.y1;
					continue;
				}
				if(nx2<0 || ny2<0 || nx2>=w || ny2>=h || board[ny2][nx2]==1){
					nx2=u.x2;
					ny2=u.y2;
					continue;
				}
				que.push(T(nx1,ny1,nx2,ny2,u.count+1));
			}
		}
		
		printf("NA\n");
		A:;
	}
}

C++: #include <iostream>
#include <queue>
#include <map>
#include <string>


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

int X, Y;

bool map[50][50];
bool passed[50][50][50][50];

struct P
{
    int tx, ty;
    int kx, ky;
    int cost;

    P(int _tx, int _ty, int _kx, int _ky, int _cost) : tx(_tx), ty(_ty), kx(_kx), ky(_ky), cost(_cost) {};
};

bool check(int x, int y)
{
    return x < 0 || x >= X || y < 0 || y >= Y || map[y][x];
}

int main()
{
    int tx, ty, kx, ky, ans;
    while(cin >> X >> Y, X|Y)
    {
        ans = -1;
        memset(passed, 0, sizeof passed);
        queue<P> que;

        cin >> tx >> ty >> kx >> ky;
        tx--, ty--, kx--, ky--;

        for(int i = 0; i < Y; i++)
            for(int j = 0; j < X; j++)
                cin >> map[i][j];

        passed[tx][ty][kx][ky] = true;

        for(que.push(P(tx, ty, kx, ky, 0)); !que.empty(); que.pop())
        {
            P p = que.front();

            if(p.cost >= 100)
                break;

            if(p.tx == p.kx && p.ty == p.ky)
            {
                ans = p.cost;
                break;
            }

            for(int i = 0; i < 4; i++)
            {
                int mtx = p.tx + dx[0][i], mty = p.ty + dy[0][i];
                int mkx = p.kx + dx[1][i], mky = p.ky + dy[1][i];

                if(check(mtx, mty))
                    mtx = p.tx, mty = p.ty;
                if(check(mkx, mky))
                    mkx = p.kx, mky = p.ky;
                if(passed[mtx][mty][mkx][mky])
                    continue;

                passed[mtx][mty][mkx][mky] = true;
                que.push(P(mtx, mty, mkx, mky, p.cost + 1));
            }
        }

        if(ans == -1)
            puts("NA");
        else
            cout << ans << endl;
    }
}

C++: #include<bits/stdc++.h>
#define P pair<int,int>
using namespace std;

bool c[52][52];
int d[52][52];
int x[4] = { -1,0,0,1 }, y[4] = { 0,-1,1,0 };
int main() {
	int a, b;
	while (cin >> a >> b, a | b) {
		memset(c, true, sizeof(c));
		memset(d,-1,sizeof(d));
		int e, f, g, h; cin >> e >> f >> g >> h;
		for (int i = 0; i < b; i++) {
			for (int j = 0; j < a; j++) {
				cin >> c[j + 1][i + 1];
			}
		}
		if (((e + g) & 1) == ((f + h) & 1)) {
		queue<P>Q;
		Q.push(P(e,f));
		d[e][f] = 0;
		while (Q.size()) {
			P o = Q.front(); Q.pop();
			for (int i = 0; i < 4; i++) {
				if (!c[o.first + x[i]][o.second + y[i]]&&!c[e+g-(o.first + x[i])][f+h-(o.second + y[i])]&& d[o.first + x[i]][o.second + y[i]] ==-1) {
					d[o.first + x[i]][o.second + y[i]] = d[o.first][o.second] + 1;
					Q.push(P(o.first + x[i], o.second + y[i]));
				}
			}
		}
		if (d[(e + g) / 2][(f + h) / 2] == -1)puts("NA");
		else cout << d[(e + g) / 2][(f + h) / 2] << endl;
		}
		else puts("NA");
	}
}