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 <bits/stdc++.h>
#define INF 1000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
double G[101][101];

void dijkstra(int s,int g){
  ll D[101],from[101];
  for(int i=0;i<101;i++) D[i]=INF;
  
  priority_queue<P,vector<P>,greater<P> > Q;
  D[s]=0;
  Q.push(P(0,s));
  while(!Q.empty()){
    P t=Q.top(); Q.pop();
    ll pos=t.second,cost=t.first;
    if(pos==g) break;
    if(D[pos]<cost) continue;
    
    for(int i=0;i<n;i++){
      if(G[pos][i]==-1||i==pos)continue;
      if(D[i]==INF){
	Q.push(P(cost+1,i));
	D[i]=cost+1;
	from[i]=pos;
      }
    }
  }

  if(D[g]==INF){cout<<"NA"<<endl;return;}
    
  vector<int> res;
  res.push_back(g);
  int pos=g;
  while(pos!=s){
    pos=from[pos];
    res.push_back(pos);
  }

  for(int i=0;i<res.size();i++){
    if(i) cout<<" ";
    cout<<res[res.size()-1-i]+1;
  }
  cout<<endl;
}


int main(){
  while(cin>>n,n){

  double x[101],y[101];
  for(int i=0;i<n;i++){
    int b;
    cin>>b;
    cin>>x[b-1]>>y[b-1];
  }
  
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++){
      ll X=(x[i]-x[j]);
      ll Y=(y[i]-y[j]);
      ll dis=X*X+Y*Y;
      if(dis>50*50)G[i][j]=G[j][i]=-1;
      else G[i][j]=G[j][i]=dis;
    }

  int m;
  cin>>m;
  while(m--){
    int s,g;
    cin>>s>>g;
    dijkstra(s-1,g-1);
  }
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P ,P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e5) + 5;
constexpr double EPS = 1e-9;

int main() {
    int n, m;
    double x[100], y[100], d[100][100], dmin[100], pre[100];
    bool used[100];
    while(cin >> n, n){
        for(int i=0;i<n;i++){
            int b;
            cin >> b;
            cin >> x[b-1] >> y[b-1];
        }
        cin >> m;
        for(int i=0;i<n;i++){
            fill(d[i], d[i]+n, IINF);
        }
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                double tmp = pow(pow(x[i]-x[j],2)+pow(y[i]-y[j],2),0.5);
                if(tmp < 50 + EPS){
                    d[i][j] = tmp;
                    d[j][i] = tmp;
                }
            }
        }
        for(;m>0;m--){
            int s, g, now;
            cin >> s >> g;
            s--; g--;
            fill(dmin, dmin+n, IINF);
            fill(used, used+n, false);
            dmin[g] = 0;
            pre[g] = -1;
            now = g;
            for(int i=0;i<n;i++){
                used[now] = true;
                for(int j=0;j<n;j++){
                    if(dmin[j] > dmin[now] + d[now][j]){
                        dmin[j] = dmin[now] + d[now][j];
                        pre[j] = now;
                    }
                }
                double mi = IINF;
                for(int j=0;j<n;j++){
                    if(used[j]) continue;
                    if(mi > dmin[j]){
                        mi = dmin[j];
                        now = j;
                    }
                }
            }
            if(dmin[s] < IINF - EPS){
                cout << s+1;
                now = pre[s];
                while(now != -1){
                    cout << " " << now+1;
                    now = pre[now];
                }
                cout << endl;
            }
            else{
                cout << "NA" << endl;
            }
        }
    }
    return 0;
}

C++: #include <iostream>
#include <cmath>
#define INF 1e+9
#define EPS 1e-9
using namespace std;

int main(){
	int n,b[100];
	double x[100],y[100];
	double cost[100][100];
	int next[100][100];
	while(cin >> n,n){
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++) {
				cost[i][j] = INF;
				next[i][j] = j;
			}
			cost[i][i] = 0;
		}
		for(int i = 0;i < n;i++) cin >> b[i] >> x[i] >> y[i];
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				double d = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
				if(i != j && d <= 2500.0){
					cost[i][j] = sqrt(d);
					cost[j][i] = sqrt(d);
				}
			}
		}
		for(int k = 0;k < n;k++){
			for(int i = 0;i < n;i++){
				for(int j = 0;j < n;j++){
					if(cost[i][j] > cost[i][k] + cost[k][j]){
						cost[i][j] = cost[i][k] + cost[k][j];
						next[i][j] = next[i][k];
					}
				}
			}
		}
		int m;
		cin >> m;
		for(int i = 0;i < m;i++){
			int s,g,S,G;
			cin >> s >> g;
			for(int j = 0;j < n;j++){
				if(b[j] == s) S = j;
				if(b[j] == g) G = j;
			}
			if(cost[S][G] == INF){
				cout << "NA" << endl;
				continue;
			}
			while(S != G){
				cout << b[S] << " ";
				S = next[S][G];
			}
			cout << b[G] << endl;
		}
	}
	
	return 0;
}