Go: package main

import (
	"container/heap"
	"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)
	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)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]struct{}, 0)
	for pq.Len() > 0 {
		now := heap.Pop(&pq).(*Status)
		if now.Person.Distance() == 0 {
			fmt.Println(now.Turn)
			return
		}
		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = struct{}{}
		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)
			}
		}
	}
	fmt.Println("NA")
}

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

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
struct P{
  P(){};
  P(int a,int b){
    x=a,y=b;
  }
  int x,y;
  void move(int,int);
};
struct S{
  S(){};
  S(P a,P b){
    t=a;
    k=b;
  }
  P t,k;
  void move(int);
};

P size;
S f_pos;
vector<vector<int> > f;
bool input(){
  size=P();
  f_pos=S();
  f.clear();
  cin>>size.y>>size.x;
  if(size.x==0&&size.y==0)return false;
  cin>>f_pos.t.y>>f_pos.t.x;
  cin>>f_pos.k.y>>f_pos.k.x;
  vector<int> t;
  for(int i=0;i<size.y+2;i++){
    t.push_back(1);
  }
  f.push_back(t);
  for(int i=0;i<size.x;i++){
    vector<int> tt;
    tt.push_back(1);
    for(int j=0;j<size.y;j++){
      int tmp;
      cin>>tmp;
      tt.push_back(tmp);
    }
    tt.push_back(1);
    f.push_back(tt);
  }
  f.push_back(t);
  return true;
}
int cost[60][60][60][60];
const int vx[]={0,0,1,-1};
const int vy[]={1,-1,0,0};
void S::move(int i){
  t.move(vx[i],vy[i]);
  k.move(-vx[i],-vy[i]);
}
void P::move(int a,int b){
  if(f[x+a][y+b]!=1){
    x+=a;
    y+=b;
  }
}
int solve(){
  for(int i=0;i<60;i++){
    for(int j=0;j<60;j++){
      for(int k=0;k<60;k++){
        for(int l=0;l<60;l++){
          cost[i][j][k][l]=-1;
        }
      }
    }
  }
  queue<S> q;
  q.push(f_pos);
  cost[f_pos.t.x][f_pos.t.y][f_pos.k.x][f_pos.k.y]=0;
  while(!q.empty()){
    S now = q.front();q.pop();
    for(int i=0;i<4;i++){
      S tmp = now;
      tmp.move(i);
      if(cost[tmp.t.x][tmp.t.y][tmp.k.x][tmp.k.y]!=-1)continue;

      cost[tmp.t.x][tmp.t.y][tmp.k.x][tmp.k.y] = cost[now.t.x][now.t.y][now.k.x][now.k.y]+1;
      if(cost[tmp.t.x][tmp.t.y][tmp.k.x][tmp.k.y]>=100){
        return -1;
      }else if( (tmp.t.x==tmp.k.x)&&(tmp.t.y==tmp.k.y) ){
        return cost[tmp.t.x][tmp.t.y][tmp.k.x][tmp.k.y];
      }else{
        q.push(tmp);
      }
    }
  }
  return -1;
}
int main(){
  while(input()){
    /*
    for(int i=0;i<f.size();i++){
      for(int j=0;j<f[i].size();j++){
        cout<<f[i][j];
      }cout<<endl;
    }cout<<endl;
    */
    int ans= solve();
    if(ans==-1||ans>=100){
      cout<<"NA"<<endl;
    }else{
      cout<<ans<<endl;
    }
  }
}

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

#define INF (1 << 25)

using namespace std;

vector<vector<vector<vector<int> > > > dp;

vector<vector<int> > M;

int H, W, sx1, sy1, sx2, sy2;

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

int bfs()
{
    dp = vector<vector<vector<vector<int> > > >(H, vector<vector<vector<int> > >(W, vector<vector<int> >(H, vector<int>(W, INF)))); dp[sy1][sx1][sy2][sx2] = 0;
    
    queue<pair<pair<pair<int, int>, pair<int, int> >, int> > que; que.push(make_pair(make_pair(make_pair(sx1, sy1), make_pair(sx2, sy2)), 0));
    
    while(!que.empty())
    {
        int x1 = que.front().first.first.first;
        int y1 = que.front().first.first.second;
        int x2 = que.front().first.second.first;
        int y2 = que.front().first.second.second;
        
        int turn = que.front().second;
        
        que.pop();
        
        for(int dir = 0; dir < 4; dir++)
        {
            int tx1 = x1 + dx[dir]; if(tx1 < 0 || tx1 > W) { tx1 -= dx[dir]; }
            int ty1 = y1 + dy[dir]; if(ty1 < 0 || ty1 > H) { ty1 -= dy[dir]; }
            int tx2 = x2 - dx[dir]; if(tx2 < 0 || tx2 > W) { tx2 += dx[dir]; }
            int ty2 = y2 - dy[dir]; if(ty2 < 0 || ty2 > H) { ty2 += dy[dir]; }
            
            if(M[ty1][tx1] == 1) { tx1 -= dx[dir]; ty1 -= dy[dir]; }
            if(M[ty2][tx2] == 1) { tx2 += dx[dir]; ty2 += dy[dir]; }
            
            if(tx1 == tx2 && ty1 == ty2) { return turn + 1; }
            
            if(dp[ty1][tx1][ty2][tx2] == INF)
            {
                dp[ty1][tx1][ty2][tx2] = turn + 1;
                
                que.push(make_pair(make_pair(make_pair(tx1, ty1), make_pair(tx2, ty2)), turn + 1);
            }
        }
    }
    
    return -1;
}

int main()
{
    while(true)
    {
        cin >> W >> H;
        
        if(H == 0 && W == 0) { break; }
        
        M = vector<vector<int> >(H, vector<int>(W));
        
        cin >> sx1 >> sy1 >> sx2 >> sy2;
        
        sx1--; sy1--; sx2--; sy2--;
        
        for(int i = 0; i < H; i++)
        {
            for(int j = 0; j < W; j++)
            {
                cin >> M[i][j];
            }
        }
        
        int Ans = bfs();
        
        cout << (Ans == -1 ? "NA" : Ans) << endl;
    }
    
    return 0;
}