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<queue>
#include<vector>
#include<cstring>
#include<functional>
using namespace std;
typedef pair<double, int> P;
priority_queue<P, vector<P>, greater<P>> Q;
#define MAX_N 1005
int x[MAX_N], y[MAX_N]; double dist[MAX_N];
vector<int>path[MAX_N]; vector<P>X[MAX_N];
void dijkstra(int a, int b) {
	memset(dist, 1e+9, sizeof(dist));
	for (int i = 0; i < MAX_N; i++) { path[i].clear(); }
	Q.push(make_pair(0.0, a)); dist[a] = 0; path[a].push_back(a);
	while (!Q.empty()) {
		pair<double, int>pa = Q.top(); Q.pop();
		double a1 = pa.first; int a2 = pa.second;
		for (int i = 0; i < X[a2].size(); i++) {
			int to = X[a2][i].second; double dis = X[a2][i].first;
			if (dist[to] > a1 + dis) {
				dist[to] = a1 + dis; path[to].clear();
				path[to] = path[a2]; path[to].push_back(to);
				Q.push(make_pair(dist[to], to));
			}
		}
	}
	if (path[b].size() == 0) { cout << "NA" << endl; }
	else {
		for (int i = 0; i < path[b].size(); i++) { if (i) { cout << ' '; } cout << path[b][i]; }
		cout << endl;
	}
}
int main() {
	int N, Q, s, g;
	while (true) {
		cin >> N; if (N == 0) { break; }
		for (int i = 0; i < N; i++) { cin >> x[i] >> y[i]; }
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				double dist2 = (x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]);
				if (dist2 <= 50.0) {
					X[i].push_back(make_pair(dist2, j));
				}
			}
		}
		cin >> Q; for (int i = 0; i < Q; i++) { cin >> s >> g; dijkstra(s, g); }
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
using namespace std;

#define loop(i, n) for (int i = 1; i < n; i++)
#define INF 1010001000

typedef pair<int, int> i_i;
typedef pair<double, int> d_i;

double calc(i_i &a, i_i &b);
void dijkstra(int st, int en, vector<vector<double> > &g);
void print(int st, int en, vector<int> &path);

int n;

int main()
{
    cin >> n;
    while (n) {
        n++;
        vector<vector<double> > g(n, vector<double>(n));
        vector<i_i > ob(n);
        loop(i, n) {
            int a;
            cin >> a;
            cin >> ob[a].first >> ob[a].second;
        }
        loop(i, n) {
            loop(j, n) {
                g[i][j] = calc(ob[i], ob[j]);
            }
        }
        int m;
        cin >> m;
        m++;
        loop(i, m) {
            int a, b;
            cin >> a >> b;
            dijkstra(a, b, g);
        }
        cin >> n;
    }
    return 0;
}

void dijkstra(int st, int en, vector<vector<double> > &g)
{
    priority_queue<d_i, vector<d_i>, greater<d_i> > pq;
    vector<double> d(n, INF);
    vector<int> prev(n, -1);
    d[st] = 0;
    pq.push(make_pair(0.0, st));

    while (!pq.empty()) {
        d_i tmp = pq.top();
        pq.pop();
        int v = tmp.second;
        if (d[v] < tmp.first) {
            continue;
        }
        for (int i = 1; i < n; i++) {
            if (d[i] > d[v] + g[v][i]) {
                d[i] = d[v] + g[v][i];
                prev[i] = v;
                pq.push(i_i(d[i], i));
            }
        }
    }
    if (d[en] != INF) {
        print(st, en, prev);
        cout << en << endl;
    } else {
        cout << "NA" << endl;
    }
}

void print(int st, int en, vector<int> &path)
{
    int wt = path[en];
    if (wt != st) {
        print(st, wt, path);
    }
    cout << wt << " ";
}
        

double calc(i_i &a, i_i &b) 
{
    int x1 = a.first, x2 = b.first, y1 = a.second, y2 = b.second;
    int tmp = (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);
    double len = sqrt((double)tmp);
    return (50.0000<len)?INF:len;
}