Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"math"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	dd := make([][]int, 1000)
	for i := range dd {
		dd[i] = make([]int, 1000)
	}
	num := make([]int,1000)
	inv := make([]int, 1001)
	x := make([]int, 1000)
	y := make([]int, 1000)
	vv := make([]int, 1000)
	nowt := make([]float64, 1000)
	rev := make([]int, 1000)
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf1 := strings.Split(scanner.Text(), " ")
			num[i], _ = strconv.Atoi(buf1[0])
			x[i], _ = strconv.Atoi(buf1[1])
			y[i], _ = strconv.Atoi(buf1[2])
			inv[num[i]] = i
		}
		for i := 0; i < n; i++ {
			for j := 0; j < n; j++ {
				dd[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])
			}
		}
		scanner.Scan()
		m, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf2 := strings.Split(scanner.Text(), " ")
			c, _ := strconv.Atoi(buf2[0])
			d, _ := strconv.Atoi(buf2[1])
			c = inv[c]
			d = inv[d]
			for j := 0; j < n; j++ {
				vv[j] = 0
				nowt[j]=999999999
				rev[j]=-1
			}
			nowt[c]=0
			for j := 0; j < n; j++ {
				M := 99999999
				at := 0
				for k := 0; k < n; k++ {
					if vv[k] == 0 && float64(M) > nowt[k] {
						M=int(nowt[k])
						at = k
					}
				}
				if M > 90000000 {
					break
				}
				vv[at]=1
				for k := 0; k < n; k++ {
					if vv[k] == 0 && dd[at][k]<=2500&&nowt[k]>nowt[at]+math.Sqrt(float64(dd[at][k])) {
						nowt[k]=nowt[at]+math.Sqrt(float64(dd[at][k]))
						rev[k] = at
					}
				}
			}
			if vv[d] == 0 {
				fmt.Println("NA")
			} else {
				stack := make([]int, 0)
				V := d
				for V != c {
					stack = append(stack, V)
					V = rev[V]
				}
				fmt.Print(num[c])
				for len(stack) > 0 {
					fmt.Printf(" %d", num[stack[len(stack)-1]])
					stack = stack[:len(stack)-1]
				}
				fmt.Println()
			}
		}
	}
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
 
using namespace std;
 
struct Point{
    double x,y;
};
 
int main(){
 
    int n,m,checkTable[101],path[101],id,start,goal,count,min_index;
    double distance[101][101],x,y,calc[101][101],min_value;
    bool canGO[101];
    Point table[101];
    stack<int> S;
 
    while(true){
        scanf("%d",&n);
        if(n == 0)break;
 
        for(int i=1; i <= n; i++){
            scanf("%d %lf %lf",&id,&x,&y);
            table[id].x = x;
            table[id].y = y;
        }
 
        for(int i = 1; i <= n; i++){
            for(int k = 1; k <= n; k++){
                distance[i][k] = sqrt((table[i].x-table[k].x)*(table[i].x-table[k].x)+(table[i].y-table[k].y)*(table[i].y-table[k].y));
            }
        }
 
        scanf("%d",&m);
 
        for(int i = 1; i <= m; i++){
            scanf("%d %d",&start,&goal);
 
            for(int k = 1; k <= n; k++){
                checkTable[k] = 0;
                if(distance[start][k] < 50 || fabs(distance[start][k] - 50) < 0.00000001){
                    canGO[k] = true;
                }else{
                    canGO[k] = false;
                }
                path[k] = start;
                for(int p = 1; p <= n; p++)calc[k][p] = distance[k][p];
            }
 
            count = 1;
            checkTable[start] = 1;
 
            while(count < n){
                min_value = 1000000000;
 
                for(int k = 1; k <= n; k++){
                    if(checkTable[k] == 0 && canGO[k] == true && calc[start][k] < min_value){
                        min_value = calc[start][k];
                        min_index = k;
                    }
                }
 
                if(min_value == 1000000000)break;
 
                checkTable[min_index] = 1;
                count++;
 
                for(int p = 1; p <= n; p++){
                    if((canGO[p] == false || calc[start][p] > calc[start][min_index]+calc[min_index][p]) && (distance[min_index][p] < 50 || fabs(distance[min_index][p] - 50) < 0.00000001)){
                        calc[start][p] = calc[start][min_index]+calc[min_index][p];
                        canGO[p] = true;
                        path[p] = min_index;
                    }
                }
            }
 
            if(canGO[goal] == false)printf("NA\n");
            else{
                int t = goal;
                while(true){
                    S.push(t);
                    t = path[t];
                    if(t == start)break;
                }
                printf("%d",start);
                while(!S.empty()){
                    printf(" %d",S.top());
                    S.pop();
                }
                printf("\n");
            }
        }
    }
 
 
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))

using namespace std;

int n, x[1001], y[1001], m, s[1001], g[1001], pre[1001];
float amt[1001][1001], vtx[1001];

queue<int> que;
stack<int> out;

int main()
{
	while( cin >> n, n)
	{
		CLR(amt);

		FOR(i, 0, n)
		{
			int b;
			cin >> b >> x[i] >> y[i];
		}

		cin >> m;

		FOR(i, 0, m)
		{
			cin >> s[i] >> g[i];
			s[i]--;
			g[i]--;
		}

		FOR(j, 0, n)
			FOR(i, j, n)
			{
				if( i != j )
				{
					double dis =  sqrt( pow((float)(x[i] - x[j]), 2) + pow((float)(y[i] - y[j]), 2) );

					if(dis <= 50.0)
					{
						amt[j][i] = dis;
						amt[i][j] = dis;
					}
				}
			}
		
		FOR(k, 0, m)
		{
			que.push(s[k]);

			FOR(i, 0, n)
			{
				vtx[i] = INT_MAX;
			}
		
			vtx[s[k]] = 0;

			while(!que.empty())
			{
				int now = que.front();
				que.pop();

				FOR(tg, 0, n)
				{
					if( amt[now][tg] > 0 && now != tg && vtx[now] + amt[now][tg] < vtx[tg] )
					{
						vtx[tg] = vtx[now] + amt[now][tg];
						pre[tg] = now;
						que.push(tg);
					}
				}

			}

			if( vtx[g[k]] >= INT_MAX )
			{
				cout << "NA" <<endl;
			}
			else
			{
				int now = g[k];
				
				while( now != s[k] )
				{
					out.push(pre[now]);
					now = pre[now];
				}

				while( !out.empty() )
				{
					cout << out.top()+1 << " ";
					out.pop();
				}

				cout << g[k]+1 << endl;
			}
		}


	}

	return 0;

}