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(102)
	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 _, 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 += 1
			if next.Turn <= 100 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				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;
const int INF=(1<<21);
typedef pair<int,int> P;
int x,y;
int tx,ty;
int kx,ky;
int t_check[50][50];
int k_check[50][50];
int depart[50][50];
int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int ans=0;

int bfs(){
  queue<P> t_que;
  queue<P> k_que;

  for(int i=0;i<y;i++){
    for(int j=0;j<x;j++){
      t_check[i][j]=k_check[i][j]=INF;
    }
  }

  t_check[ty][tx]=0;
  k_check[ky][kx]=0;

  t_que.push(P(ty,tx));
  k_que.push(P(ky,kx));

  while(t_que.size()){
    P tp=t_que.front();t_que.pop();
    P kp=k_que.front();k_que.pop();
    if(tp.first==kp.first && tp.second==kp.second){
      return t_check[tp.first][tp.second];
    }

    for(int i=0;i<4;i++){
      int tnx=tp.second+dx[i];
      int tny=tp.first+dy[i];
      int knx=kp.second-(dx[i]);
      int kny=kp.first-(dy[i]);

      if(0<=tnx && tnx<x && 0<=tny && tny<y && depart[tny][tnx]!=1 && t_check[tny][tnx]==INF  &&  0<=knx && knx<x && 0<=kny && kny<y && depart[kny][knx]!=1 && k_check[kny][knx]==INF){

	t_que.push(P(tny,tnx));
	k_que.push(P(kny,knx));
	t_check[tny][tnx]=t_check[tp.first][tp.second]+1;
	k_check[kny][knx]=k_check[kp.first][kp.second]+1;

      }
    }
  }
  return -1;
}
int main(){
  while(1){
    cin>> x>> y;
  if(x==0 && y==0){
    break;
  }
  cin>> tx>> ty;
  cin>> kx>> ky;
  for(int i=0;i<y;i++){
    for(int j=0;j<x;j++){
      cin>> depart[i][j];
    }
  }
  ans=bfs();
  if(ans==-1){
    cout<< "NA"<<endl;
  }else{
    cout<< ans<< endl;
  }
  }
}

C++: #include<iostream>
#include<queue>
#include<cstring>
using namespace std;
struct PP{
	int kx;
	int ky;
	int tx;
	int ty;
	int Z;
};
int w,h;
PP S;
bool A[53][53][53][53],D[53][53];
int main(){
	queue<PP> P;
	int d=0,i=0,j=0,l=-1;
	int tx[4]={ 1, 0,-1,0 };       
	int ty[4]={ 0, 1, 0,-1 };
	cin>>w>>h;
	while(w!=0||h!=0){
		memset(A,0,sizeof(A));
		for(i=0;i<=h+1;i++){
			for(j=0;j<=w+1;j++){
				D[i][j]=1;
			}
		}

		cin>>S.tx>>S.ty;
		cin>>S.kx>>S.ky;
		for(i=1;i<=h;i++){
			for(j=1;j<=w;j++){
				cin>>D[i][j];
			}
		}
		S.Z=0;
		P.push(S);
		if(S.tx==S.kx&&S.ty==S.ky){
			d=-1;
			cout<<S.Z<<endl;
		}
		while(d!=-1){
			l++;
			S=P.front();
			if(l==4){
				l=0;
				P.pop();
			//	if(P.empty()){
			//		cout<<"NA"<<endl;
			//		break;
			//	}
			}

			S.tx=S.tx+tx[l];
			S.ty=S.ty+ty[l];
			S.kx=S.kx+tx[l]*-1;
			S.ky=S.ky+ty[l]*-1;
			if(A[S.ty][S.tx][S.ky][S.kx]==1||(D[S.ty][S.tx]==1&&D[S.ky][S.kx]==1)){
				continue;
			}
			A[S.ty][S.tx][S.ky][S.kx]=1;

			if(D[S.ty][S.tx]==1){
				S.tx=S.tx-tx[l];
				S.ty=S.ty-ty[l];
			}
			if(D[S.ky][S.kx]==1){
				S.kx=S.kx-tx[l]*-1;
				S.ky=S.ky-ty[l]*-1;
			}
			//saka();
			S.Z++;
			P.push(S);
			if(S.tx==S.kx&&S.ty==S.ky){
				cout<<S.Z<<endl;
				break;
			}	
			if(S.Z==100){
				cout<<"NA"<<endl;
				break;
			}


		}
		while(!P.empty()){
			P.pop();
		}
		d=0;
		l=-1;
		cin>>w>>h;
	}	
	return 0;
}

C++: #include<queue>
#include<iostream>
#include<algorithm>
#include <conio.h>
using namespace std;
struct maigo{
	int x[2];// ????????????[0]???????????????[1]
	int y[2];// ????????????[0]???????????????[1]
	int count;
};
int main(){
	queue<maigo> q;
	int tx, ty; int kx, ky;
	int **depart, X, Y;
	int flag = 0, a = 0;
	cin >> X >> Y;
	while (X != 0 && Y != 0){
		depart = new int*[Y + 2];
		for (int i = 0; i < Y + 2; i++){
			depart[i] = new int[X + 2];
		}
		for (int i = 0; i < Y + 2; i++){
			for (int l = 0; l < X + 2; l++){
				depart[i][l] = 3;
			}
		}
		cin >> tx >> ty;
		cin >> kx >> ky;
		for (int i = 1; i < Y + 1; i++){
			for (int l = 1; l < X + 1; l++){
				cin >> depart[i][l];
			}
		}
		maigo temp;
		temp.x[0] = tx; temp.y[0] = ty;
		temp.x[1] = kx; temp.y[1] = ky;
		temp.count = 1;
		q.push(temp);
		while (!q.empty() && flag == 0){
			maigo t = q.front();
			q.pop();
			int dx1[4] = { 1, 0, -1, 0 }; int dx2[4] = { 0, 1, 0, -1 };
			for (int i = 0; i < 4; i++){
				if (depart[t.x[0] + dx1[i]][t.y[0] + dx2[i]] == 0 &&
					depart[t.x[1] + dx1[i] * (-1)][t.y[1] + dx2[i] * (-1)] == 0){
					depart[t.x[0] + dx1[i]][t.y[0] + dx2[i]] = -1;
					depart[t.x[1] + dx1[i] * (-1)][t.y[1] + dx2[i] * (-1)] = -1;
					if (t.x[0] + dx1[i] == t.x[1] + dx1[i] * (-1) &&
						t.y[0] + dx2[i] == t.y[1] + dx2[i] * (-1)){
						cout << t.count << endl;
						flag = 1;
					}
					maigo into;
					into.x[0] = t.x[0] + dx1[i], into.y[0] = t.y[0] + dx2[i];
					into.x[1] = t.x[1] + dx1[i] * (-1), into.y[1] = t.y[1] + dx2[i] * (-1);
					into.count = t.count + 1;
					if (into.count >= 100){
						flag = 1;
						a = 1;
					}
					q.push(into);
				}
			}
		}if (a == 1||flag == 0) {
			cout << "NA" << endl;
		}while (!q.empty()) q.pop();
		a = 0; flag = 0;
		cin >> X >> Y;
	}
	return 0;
}