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 ans <= now.Turn {
			continue
		}
		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = now.Turn

		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = 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 <bits/stdc++.h>
using namespace std;

int table[52][52];

bool memo[52][52][52][52];

const int leftmove = -1;
const int rightmove = 1;
const int upmove = -1;
const int downmove = 1;

int main() {

    while(1){

        int w,h;

        //scanf(" %d %d",&w,&h);

        cin >> w >> h;

        if(w==0&&h==0) break;

        int tx,ty,kx,ky;

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

        cin >> tx >> ty >> kx >> ky;

        for(int i=1;i<51;i++){
            for(int j=1;j<51;j++){
                table[i][j] = 1;
                for(int k=0;k<51;k++){
                    for(int r=0;r<51;r++){
                        memo[i][j][k][r] = false;
                    }
                }
            }
        }

        for(int i=1;i<=h;i++){
            for(int j=1;j<=w;j++){
                //scanf(" %d",&table[i][j]);
                cin >> table[i][j];
            }
        }

        /*printf("\n");

        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                printf("%d ",table[i][j]);
            }
            printf("\n");
        }*/

        //memset(memo,false,sizeof(memo));

        queue<vector<int> > q;

        vector<int> v(5);

        v[0] = tx; v[1] = ty; v[2] = kx; v[3] = ky; v[4] = 0;

        if(table[v[0]][v[1]] == 1 || table[v[2]][v[3]] == 1){
            cout << "NA" << endl;
            continue;
        }

        q.push(v);

        bool check = false;

        while(!q.empty()){

            v = q.front(); q.pop();

            if(memo[v[0]][v[1]][v[2]][v[3]]){
                continue;
            }

            if(v[0] == v[2] && v[1] == v[3]){
                check = true;
                cout << v[4] << endl;
                break;
            }

            memo[v[0]][v[1]][v[2]][v[3]] = true;

            v[4]++;

            if(v[4] >= 100){
                break;
            }

            vector<int> before(5);

            for(int i=0;i<5;i++){
                before[i] = v[i];
            }

            if(v[0]+leftmove != 0 && table[v[0]+leftmove][v[1]] == 0){
                v[0]+=leftmove;
            }
            if(v[2]+rightmove != w+1 && table[v[2]+rightmove][v[3]] == 0){
                v[2]+=rightmove;
            }

            q.push(v);

            for(int i=0;i<5;i++){
                v[i] = before[i];
            }

            if(v[2]+leftmove != 0 && table[v[2]+leftmove][v[3]] == 0){
                v[2]+=leftmove;
            }
            if(v[0]+rightmove != w+1 && table[v[0]+rightmove][v[1]] == 0){
                v[0]+=rightmove;
            }

            q.push(v);


            for(int i=0;i<5;i++){
                v[i] = before[i];
            }

            if(v[3]+upmove != 0 && table[v[2]][v[3]+downmove] == 0){
                v[3]+=upmove;
            }
            if(v[1]+downmove != h+1 || table[v[0]][v[1]+upmove] == 0){
                v[1]+=downmove;
            }

            q.push(v);

            for(int i=0;i<5;i++){
                v[i] = before[i];
            }

            if(v[1]+upmove != 0 && table[v[0]][v[1]+upmove] == 0){
                v[1]+=upmove;
            }
            if(v[3]+downmove != h+1 && table[v[2]][v[3]+downmove] == 0){
                v[3]+=downmove;
            }

             q.push(v);
        }

        if(!check){
            cout << "NA" << endl;
        }



    }

    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <queue>
#include <map>
using namespace std;

struct Point{
  int tx,ty,kx,ky,time;
};

int main(){
  int i,j,k,l,X,Y,G[51][51],ans;
  bool D[51][51][51][51];
  while(1){
    Point p;
    queue <Point> Q;
    cin >> X >> Y;
    if(X == 0 && Y == 0) break;
    cin >> p.tx >> p.ty;
    cin >> p.kx >> p.ky;

    for(i=1;i<=Y;i++){
      for(j=1;j<=X;j++){
	cin >> G[j][i];
	for(k=1;k<=X;k++){
	  for(l=1;l<=Y;l++) D[j][k][i][l] = false;
	}
      }
    }

    Q.push(p);
    p.time = 0;
    D[p.tx][p.kx][p.ty][p.ky] = true;
    ans = 0;

    while(!Q.empty()){
      p = Q.front();
      Q.pop();
      if(p.tx == p.kx && p.ty == p.ky || p.time >= 100){
	ans = p.time;
	break;
      }
      int x[4] = {1,0,-1,0};
      int y[4] = {0,1,0,-1};
      Point v;

      for(i=0;i<4;i++){
	int ntx = p.tx + x[i];
	int nty = p.ty + y[i];
	int nkx = p.kx + x[(i+2)%4];
	int nky = p.ky + y[(i+2)%4];
	if(ntx > 1 && nkx > 1 && ntx <= X && nkx <= X && nty > 1 && nky > 1 && nty <= Y && nky <= Y && !G[ntx][nty] && !G[nkx][nky] && !D[ntx][nkx][nty][nky]){
	  D[ntx][nkx][nty][nky] = true;
	  v.tx = ntx;
	  v.ty = nty;
	  v.kx = nkx;
	  v.ky = nky;
	  v.time = p.time + 1;
	  Q.push(v);
	}
	else if(nkx > 1 && nkx <= X && nky > 1 && nky <= Y && !G[nkx][nky] && !D[p.tx][nkx][p.ty][nky]){
	  D[p.tx][nkx][p.ty][nky] = true;
	  v.tx = p.tx;
	  v.ty = p.ty;
	  v.kx = nkx;
	  v.ky = nky;
	  v.time = p.time + 1;
	  Q.push(v);
	}
	else if(ntx > 1 && ntx <= X && nty > 1 && nty <= Y && !G[ntx][nty] && !D[ntx][p.kx][nty][p.ky]){
	  D[ntx][p.kx][nty][p.ky] = true;
	  v.tx = ntx;
	  v.ty = nty;
	  v.kx = p.kx;
	  v.ky = p.ky;
	  v.time = p.time + 1;
	  Q.push(v);
	}
      }
    }

    if(ans > 0 && ans < 100) cout << p.time << endl;
    else cout << "NA" << endl;
    
  }
  return 0;
}