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 <map>
#include <queue>
#include <sstream>

using namespace std;

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

class state {
public:
    int tx, ty;
    int kx, ky;
    int time;
    state(int a, int b, int c, int d, int e) {
        tx = a;
        ty = b;
        kx = c;
        ky = d;
        time = e;
    }
};

int h, w;
int grid[55][55];
int tx, ty, kx, ky;

void solve()
{
    int ans = -1;
    state s(tx, ty, kx, ky, 0);
    map<string, bool> m;
    queue<state> q;
    ostringstream oss;

    oss << tx << "," << ty << "," << kx << "," << ky;
    q.push(s);
    m[oss.str()] = true;

    while (!q.empty()) {
        state now = q.front();
        q.pop();

        if (now.time >= 10)
            break;
        if (now.tx == now.kx && now.ty == now.ky) {
            ans = now.time;
            break;
        }

        for (int i = 0; i < 4; i++) {
            int ntx = now.tx + dx[i];
            int nty = now.ty + dy[i];
            int nkx = now.kx + dx[(i + 2) % 4];
            int nky = now.ky + dy[(i + 2) % 4];

            if (ntx < 1 || ntx > w)
                ntx = now.tx;
            if (nty < 1 || nty > h)
                nty = now.ty;
            if (nkx < 1 || nkx > w)
                nkx = now.kx;
            if (nky < 1 || nky > h)
                nky = now.ky;
            if (grid[nty][ntx] != 0) {
                ntx = now.tx;
                nty = now.ty;
            }
            if (grid[nky][nkx] != 0) {
                nkx = now.kx;
                nky = now.ky;
            }
                
            oss.str("");
            oss << ntx << "," << nty << "," << nkx << "," << nky;

            if (m.count(oss.str()) != 0)
                continue;
            state next(ntx, nty, nkx, nky, now.time + 1);
            q.push(next);
            m[oss.str()] = true;

            // for (int y = 1; y <= h; y++) {
            //     for (int x = 1; x <= w; x++) {
            //         if (y == nty && x == nty)
            //             cout << "t";
            //         else if (y == nky && x == nky)
            //             cout << "k";
            //         else
            //             cout << grid[y][x];
            //     }
            //     cout << endl;
            // }
            // cout << endl;
//            cout << oss.str() << endl;
        }
    }
    if (ans == -1 || ans >= 10)
        cout << "NA" << endl;
    else
        cout << ans << endl;
}

int main()
{
    while (cin >> w >> h, w || h) {
        cin >> tx >> ty >> kx >> ky;
        for (int y = 1; y <= h; y++)
            for (int x = 1; x <= w; x++) 
                cin >> grid[y][x];
        solve();
    }

    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <utility>
#include <stack>
#include <string.h>
#include <complex>
using namespace std;

const int INF = 1<<29;
const double EPS = 1e-8;
typedef vector<int> vec;
typedef pair<int,int> P;

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

struct node{
    int d,tx,ty,kx,ky;
    bool operator<(const node& right) const{
        return d > right.d;
    }
};

int d[50][50][50][50];
int field[50][50];

int main(){
    while(1){
        int X,Y;
        scanf("%d%d",&X,&Y);
        if(!X)break;

        int tx,ty,kx,ky;
        scanf("%d%d%d%d",&tx,&ty,&kx,&ky);
        tx--;ty--;kx--;ky--;

        for(int i=0;i<Y;i++){
            for(int j=0;j<X;j++){
                scanf("%d",&field[i][j]);
            }
        }

        for(int i=0;i<Y;i++){
            for(int j=0;j<X;j++){
                for(int k=0;k<Y;k++){
                    for(int l=0;l<X;l++){
                        d[i][j][k][l] = INF;
                    }
                }
            }
        }
        priority_queue<node> que;
        d[tx][ty][kx][ky] = 0;
        que.push((node){0,tx,ty,kx,ky});
        bool not_reach = true;
        while(que.size()){
            node p = que.top(); que.pop();
            if(d[p.tx][p.ty][p.kx][p.ky] < p.d) continue;
            if(p.tx==p.kx&&p.ty==p.ky){
                cout << p.d << endl;
                not_reach = false;
                break;
            }
            if(p.d==100){
                break;
            }
            for(int i=0;i<4;i++){
                int n_tx = p.tx+dx[i], n_ty = p.ty+dy[i];
                int n_kx = p.kx-dx[i], n_ky = p.ky-dy[i];
                if(n_tx<0) n_tx = 0;
                else if(n_tx==X) n_tx = X-1;
                if(n_ty<0) n_ty = 0;
                else if(n_ty==Y) n_ty = Y-1;
                if(n_kx<0) n_kx = 0;
                else if(n_kx==X) n_kx = X-1;
                if(n_ky<0) n_ky = 0;
                else if(n_ky==Y) n_ky = Y-1;
                if(field[n_tx][n_ty]){
                    n_tx = p.tx; n_ty = p.ty;
                }
                if(field[n_kx][n_ky]){
                    n_kx = p.kx; n_ky = p.ky;
                }
                if(d[n_tx][n_ty][n_kx][n_ky]>p.d+1){
                    d[n_tx][n_ty][n_kx][n_ky] = p.d+1;
                    que.push((node){p.d+1,n_tx,n_ty,n_kx,n_ky});
                }
            }
        }
        if(not_reach)cout << "NA" << endl;
    }
    return 0;
}