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<bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define pb push_back
typedef pair<int,int> P;
typedef pair<P,P> PP;
typedef pair<int,PP> PPP;
int dx[4]={-1,0,0,1};
int dy[4]={0,-1,1,0};
int S[51][51][51][51];
int S1[51][51][51][51];
int main()
{
	while(true){
		int X,Y;
		int tx;int ty;
		int kx;int ky;
		scanf("%d%d",&X,&Y);
		if(X==0&&Y==0)break;
		scanf("%d%d%d%d",&tx,&ty,&kx,&ky);tx--;ty--;kx--;ky--;
		int grid[51][51];
		for(int i=0;i<Y;i++){
			for(int j=0;j<X;j++){
				scanf("%d",&grid[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++){
						S[i][j][k][l]=1001;
						//S1[i][j][k][l]=1001;
					}
				}
			}
		}
		
		priority_queue<PPP>s;
		PP x;
		x.fi.sc=tx;x.fi.fi=ty;x.sc.sc=kx;x.sc.fi=ky;
		s.push(PPP(0,x));
		int ans=1001;
		while(!s.empty()){
			//printf("%d\n",(int)s.size());
			PPP p=s.top();s.pop();
			if(S[p.sc.fi.fi][p.sc.fi.sc][p.sc.sc.fi][p.sc.sc.sc]<=p.fi)continue;
			
			if(p.sc.fi.fi==p.sc.sc.fi&&p.sc.fi.sc==p.sc.sc.sc){
				ans=min(ans,p.fi);
				
			}
			if(ans<=p.fi+1)continue;
			S[p.sc.fi.fi][p.sc.fi.sc][p.sc.sc.fi][p.sc.sc.sc]=p.fi;
			//S1[p.sc.fi.fi][p.sc.fi.sc][p.sc.sc.fi][p.sc.sc.sc]=p.fi;
			if(p.fi==100)continue;
			for(int k=0;k<4;k++){
				PP t;
				if(p.sc.fi.fi+dy[k]<0||p.sc.fi.fi+dy[k]>=Y||p.sc.fi.sc+dx[k]<0||p.sc.fi.sc+dx[k]>=X){
					t.fi.fi=p.sc.fi.fi;t.fi.sc=p.sc.fi.sc;
				}
				else if(grid[p.sc.fi.fi+dy[k]][p.sc.fi.sc+dx[k]]==1){
					t.fi.fi=p.sc.fi.fi;t.fi.sc=p.sc.fi.sc;
				}
				else{
					t.fi.sc=p.sc.fi.sc+dx[k];t.fi.fi=p.sc.fi.fi+dy[k];
				}
				if(p.sc.sc.fi-dy[k]<0||p.sc.sc.fi-dy[k]>=Y||p.sc.sc.sc-dx[k]<0||p.sc.sc.sc-dx[k]>=X){
					t.sc.sc=p.sc.sc.sc;t.sc.fi=p.sc.sc.fi;
				}
				else if(grid[p.sc.sc.fi-dy[k]][p.sc.sc.sc-dx[k]]==1){
					t.sc.sc=p.sc.sc.sc;t.sc.fi=p.sc.sc.fi;
				}
				else{
					t.sc.fi=p.sc.sc.fi-dy[k];t.sc.sc=p.sc.sc.sc-dx[k];
				}
				if(S[t.fi.fi][t.fi.sc][t.sc.fi][t.sc.sc]<=p.fi+1)continue;
				//if(S1[t.fi.fi][t.fi.sc][t.sc.fi][t.sc.sc]<=p.fi+1)continue;
				//S1[t.fi.fi][t.fi.sc][t.sc.fi][t.sc.sc]=p.fi+1;
				s.push(PPP(p.fi+1,t));
			}
		}
		if(ans==1001)printf("NA\n");
		else printf("%d\n",ans);
		
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int table[51][51];

bool memo[51][51][51][51];

int main() {

    while(1){

        int w,h;

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

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

        int tx,ty,kx,ky;

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

        tx--;ty--;kx--;ky--;

        for(int i=0;i<51;i++){
            for(int j=0;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=0;i<h;i++){
            for(int j=0;j<w;j++){
                scanf(" %d",&table[i][j]);
            }
        }

        //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;

        q.push(v);

        bool check = false;

        while(!q.empty()){

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

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

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

            if(v[0] >= w || v[1] >= h || v[2] >= w || v[3] >= h || v[0] < 0 || v[1] < 0 || v[2] < 0 || v[3] < 0 || table[v[0]][v[1]] == 1 || table[v[2]][v[3]] == 1){
                continue;
            }

            if(v[0] == v[2] && v[1] == v[3]){
                check = true;
                printf("%d\n",v[4]);
                break;
            }

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

            v[4]++;

            vector<int> before = v;

            v[0]--; v[2]++;

            q.push(v);

            v = before;

            v[0]++; v[2]--;

            q.push(v);

            v = before;

            v[1]++; v[3]--;

            q.push(v);

            v = before;

            v[1]--; v[3]++;

            q.push(v);

            /*if(v[0] >= w || v[1] >= h || v[2] >= w || v[3] >= h || v[0] < 0 || v[1] < 0 || v[2] < 0 || v[3] < 0 || table[v[0]][v[1]] == 1 || table[v[2]][v[3]] == 1){

            }else {
                q.push(v);
            }*/



        }

        if(!check){
            printf("NA\n");
        }



    }

    return 0;
}