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 <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
#define int ll
double f(int x,int y){return sqrt(x*x+y*y);}
signed main(){
    int n;
    while(cin>>n,n){
        map<int, pii>mp;
        rep(i,n){
            int hoge; pii foo; cin>>hoge>>foo.first>>foo.second;
            mp[hoge]=foo;
        }
        vector<vector<pii>>edge(n+1,vector<pii>());
        for(auto itr=mp.begin();itr!=mp.end();itr++){
            for(auto comp=mp.begin();comp!=mp.end();comp++){
                if(itr==comp)continue;
                double dis=f(abs(itr->second.first-comp->second.first),abs(itr->second.second-comp->second.second));
                if( dis-50<=EPS){
                    //cout<<itr->first<<" "<<comp->first<<endl;
                    edge[itr->first-1].push_back(pii(comp->first-1,dis));
                }
            }
        }
        int k; cin>>k;
        rep(_,k){
            int s,g; cin>>s>>g;
            --s,--g;
            priority_queue<pii,vector<pii>,greater<pii>>que;
            vector<int>prev(n+1,INF);
            vector<int>d(n+1,INF);
            d[s]=0;
            que.push(pii(0,s));
            while(!que.empty()){
                pii now=que.top(); que.pop();
                if(now.second==g)break;
                if(d[now.second]<now.first)continue;
                rep(i,edge[now.second].size()){
                    pii next=edge[now.second][i];
                    if(d[next.first]<d[now.second]+next.second)continue;
                    que.push(pii(d[now.second]+next.second,next.first));
                    d[next.first]=now.first+next.second;
                    prev[next.first]=now.second;
                }
            }
            if(edge[s].size()==0 ||edge[g].size()==-0)cout<<"NA"<<endl;
            else {
                vi hoge;
                for(int v=g;; v=prev[v]){
                    hoge.push_back(v);
                    if(v==s)break;
                }
                reverse(all(hoge));
                rep(i,hoge.size())if(i)cout<<" "<<hoge[i]+1; else cout<<hoge[i]+1;
                cout<<endl;
                //cout<<prev[2]<<prev[1]<<endl;
            }
        }
    }
}

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

struct Building
{
	int index;
	int x;
	int y;

	double distanceTo(const Building& obj)
	{
		return sqrt((x-obj.x)*(x-obj.x) + (y-obj.y)*(y-obj.y));
	}
};

struct Path
{
	int connectingIndex;
	double distance;
};

struct Agent
{
	int index;
	int prev_index;
	double distance;

	bool operator<(const Agent& rhs) const
	{
		return distance > rhs.distance;
	}
};

int n, m;
Building buildings[100];
vector<vector<Path>> edges;
int prev_index[100];
priority_queue<Agent> que;
bool defined[100];

int main()
{
	while (true)
	{
		cin >> n;
		if (n == 0)
		{
			return 0;
		}

		// initialize
		edges.assign(n, vector<Path>());

		// input
		for (int i = 0; i < n; ++i)
		{
			cin >> buildings[i].index
				>> buildings[i].x
				>> buildings[i].y;
		}

		// calc distance
		for (int i = 0; i < n; ++i)
		{
			for (int j = i + 1; j < n; ++j)
			{
				Building A = buildings[i];
				Building B = buildings[j];
				double distance = A.distanceTo(B);
				if (distance <= 50.0)
				{
					int indexA = A.index - 1;
					int indexB = B.index - 1;
					edges[indexA].push_back(Path{ indexB, distance });
					edges[indexB].push_back(Path{ indexA, distance });
				}
			}
		}
		
		// query loop
		cin >> m;
		for (int i = 0; i < m; ++i)
		{
			int s, g;
			cin >> s >> g;

			// initialize
			que = priority_queue<Agent>();
			memset(defined, 0, sizeof defined);

			// dijkstra
			bool found_goal = false;
			que.push(Agent{ s - 1, 0 });
			while (!que.empty())
			{
				Agent agent = que.top(); que.pop();
				
				if (defined[agent.index])
				{
					continue;
				}
				defined[agent.index] = true;
				prev_index[agent.index] = agent.prev_index;

				if (agent.index == g - 1)
				{
					found_goal = true;
					break;
				}

				for (auto path : edges[agent.index])
				{
					if (!defined[path.connectingIndex])
					{
						que.push(Agent{ path.connectingIndex,
						                agent.index,
						                agent.distance + path.distance });
					}
				}
			}

			// output
			if (!found_goal)
			{
				cout << "NA" << endl;
			}
			else
			{
				vector<int> path;
				int agent = g - 1;
				while (agent != s - 1)
				{
					path.push_back(agent + 1);
					agent = prev_index[agent];
				}
				cout << s;
				for (auto itr = path.rbegin(); itr != path.rend(); ++itr)
				{
					cout << ' ' << *itr;
				}
				cout << endl;
			}
		} // end of query loop
	} // end of while
}