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>
using namespace std;
//#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll mod = 1000000000 + 7;
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

int n, m;
struct edge{int to; double cost;};

vector<double> dijkstra(int s, int n, vector<vector<edge>>& g, vector<int> &pv){
    priority_queue<pdbi, vector<pdbi>, greater<pdbi>> que;
    vector<double> d(n, LLONG_MAX / 10.0); d[s] = 0.0;
    que.push(pdbi(0.0, s));

    while (!que.empty()){
        plli p = que.top();que.pop();
        int fr = p.second;
        if (d[fr] < p.first) continue;
        for (edge e: g[fr]){
            if (e.cost > 50.0) continue;
            if (d[e.to] > d[fr] + e.cost){
                d[e.to] = d[fr] + e.cost;
                pv[e.to] = fr;
                que.push(pdbi(d[e.to], e.to));
            }
        }
    }
    return d;
}

vector<int> get_path(int t, vector<int> &pv){
    vector<int> path;
    for(; t != -1; t = pv[t]) path.push_back(t);
    reverse(path.begin(),path.end());
    return path;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    while (true) {
        vector<vector<edge>> g(100 + 5);
        vector<int> pv(100 + 5, -1);
        cin  >> n;
        if (n == 0) break;
        int b[105], x[105], y[105];
        rep(i, n) {
            cin >> b[i] >> x[i] >> y[i];
            b[i]--;
        }
        rep(i, n) {
            rep(j, n) {
                if (b[i] == b[j]) continue;
                double d = sqrt(pow(x[b[i]] - x[b[j]], 2) + pow(y[b[i]] - y[b[j]], 2));
                g[b[i]].push_back(edge{b[j], d});
            }
        }
        cin >> m;
        rep(i, m) {
            int s, goal;
            cin >> s >> goal;
            s--; goal--;
            vector<double> dist = dijkstra(s, n, g, pv);
            if (dist[goal] == LLONG_MAX / 10.0) {
                cout << "NA" << endl;
                continue;
            }
            vector<int> ans = get_path(goal, pv);
            int size = ans.size();
            rep(i, size) {
                if (i != size - 1) cout << ans[i] + 1 << " ";
                else cout << ans[i] + 1<< endl;
            }
        }
    }
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <cstring>
#include <climits>

#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];
float amt[1001][1001], vtx[1001];
int pre[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;

}