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 <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <complex>
#include <map>

using namespace std;

const int MAX_V = 1001;
// d[u][v]Íu©çvÖÌRXgBßÉ×Ú·éGbWÌRXgðüêÄ¨¢½è·êÎæ¢Í¸B
double d[MAX_V][MAX_V];
const int INF=1000000000;
// ¸_
int V;

#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b))<EPS)

// prv[i][j] -> iªX^[gn_ÌÆ«Aj©çÇ±Éßé©
int prv[MAX_V][MAX_V];

// S_ÎÅZoHâèðÆ­O(V^3)AÓª ÁÄà®ì
void warshall_floyd(){
    for(int i = 0; i < V; i++){
        for(int j = 0; j < V; j++){
            for(int k = 0; k < V; k++){
                //d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
                if(d[j][k]>d[j][i]+d[i][k]){
                    int cp=k;
                    // XV
                    while(1){
                        prv[j][cp]=prv[i][cp];
                        cp=prv[i][cp];
                        if(cp==i)break;
                    }
                    d[j][k]=d[j][i]+d[i][k];
                }
            }
        }
    }
}
typedef complex<double> P;

void init(int n){
    V=n;
    for(int i = 0; i < MAX_V; i++){
        for(int j = 0; j < MAX_V; j++){
            if(i==j)d[i][j]=0;
            else d[i][j]=INF;
            prv[i][j]=INF;
        }
    }
}

int main(){
    int n;
    while(cin>>n&&n!=0){
        map<int,int> idxs;
        init(n);
        int billNum[MAX_V];
        P billP[MAX_V];
        for(int i=0;i<n;i++){
            int x,y;
            cin>>billNum[i]>>x>>y;
            billP[i]=P(x,y);
            idxs[billNum[i]]=i;
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                double dist=abs(billP[i]-billP[j]);
                // £ª50ÈºÈç¹ðìéÆ¯ÉAßèûðüêÄ¨­
                if(dist<50||EQ(dist,50)){
                    d[i][j]=dist;
                    prv[i][j]=i;
                }
            }
        }
        warshall_floyd();
        int m;
        cin>>m;
        for(int i=0;i<m;i++){
            int s,g;
            cin>>s>>g;
            s=idxs[s];
            g=idxs[g];
            if(EQ(d[s][g],INF))
                cout<<"NA"<<endl;
            else{
                vector<int> v;
                int cp=g;
                while(1){
                    v.push_back(cp);
                    if(cp==s)
                        break;
                    cp=prv[s][cp];
                }
                for(int j = v.size()-1; j >= 0; j--){
                    cout<<billNum[v[j]];
                    if(j==0)cout<<endl;
                    else cout<<" ";
                }
            }
        }
    }

  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

#define rep(i, n)for((i) = 0;(i) < (n);++(i))

struct buil{
	int n;
	string b;
	double x, y;
	void next(void){ cin >> b >> x >> y; n = stoi(b); return; }
};

bool nsort(buil qwe, buil rty){ return qwe.n < rty.n; }
buil B[100];
pair<double, string> G[100][100];
double ma = 12354567890.1;

int main(void){
	int i, j, k, n, m;
	for(;;){
		scanf("%d", &n);
		if(!n)break;
		rep(i, n)rep(j, n)G[i][j].first = ma;

		rep(i, n)B[i].next();
		sort(B, B + n, nsort);

		rep(i, n)rep(j, i){
			double tmp = (B[i].x - B[j].x) * (B[i].x - B[j].x) + (B[i].y - B[j].y) * (B[i].y - B[j].y);
			if(tmp <= 2500.0){
				G[i][j].first = sqrt(tmp); G[i][j].second = B[i].b;
				G[j][i].first = sqrt(tmp); G[j][i].second = B[j].b;
			}
		}
		rep(k, n)rep(i, n)rep(j, n)if(G[i][j].first > G[i][k].first + G[k][j].first){
			G[i][j].first = G[i][k].first + G[k][j].first;
			G[i][j].second = G[i][k].second + " " + G[k][j].second;
		}

		scanf("%d", &m);
		for(;m--;){
			scanf("%d %d", &i, &j);
			if(G[i - 1][j - 1].first < ma)cout << G[i - 1][j - 1].second << " " << B[j - 1].b << endl;
			else puts("NA");
		}
	}
	
	return 0;
}