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<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<double,int> pdi;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<pii> vp;
typedef vector<pdd> vdd;
typedef vector<pair<double,int> >vdi;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip	;
const double PI=acos(-1);
const double EPS=1e-6;
const int inf=1e8;
int main(){
	int n;
	while(cin>>n,n){
		vi m(n);
		vp in(n);
		rep(i,n){
			int a,b,c;
			cin>>a>>b>>c;
			m[i]=a;
			in[i]=pii(b,c);
		}
		vvd cost(n,vd(n,inf));
		rep(i,n)rep(j,i){
			double dis=hypot(in[i].first-in[j].first,in[i].second-in[j].second);
			if(dis<EPS+50)cost[i][j]=cost[j][i]=dis;
		}
		int N;
		cin>>N;
		while(N--){
			int a,b;
			cin>>a>>b;
			a--;b--;
			vi visit(n);
			vdi d(n,pdi(inf,inf));
			d[a]=pdi(0,0);
			while(1){
				int v=-1;
				rep(i,n)if(visit[i]==0&&(v==-1||d[v].first>d[i].first))v=i;
				if(v==-1)break;
				visit[v]=true;
				rep(i,n)if(d[v].first+cost[i][v]<d[i].first){
					d[i]=pdi(d[v].first+cost[i][v],v);
				}
			}
			if(abs(d[b].first-inf)<EPS)cout<<"NA"<<endl;
			else{
				vi out;
				out.pb(b);
				while(b!=a){
					out.pb(d[b].second);
					b=d[b].second;
				}
				for(int i=out.size()-1;i>=0;i--)
					cout<<m[out[i]]<<(i?" ":"\n");
			}
		}
	}
}

C++: 

#include<iostream>

#include<vector>

#include<algorithm>

#include <math.h>

#include<cstdio>

using namespace std;



static const int MAX = 100;

#define INF 2000000000000ll

int V, E;

double dp[MAX][MAX];

long long prev_[MAX][MAX];

int stack[MAX], sp;



void Warshall_Floyd() {

	for (int k = 0; k < V; k++) {

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				if (dp[i][k] == INF || dp[k][j] == INF) {

					continue;

				}
                if(dp[i][j]>dp[i][k]+dp[k][j]+0.0000001){
                    
				    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
                
				    prev_[i][j] = prev_[k][j];
                }

			}

		}

	}

}

void printPath2(int start, int goal) {

	int cur;



	sp = 0;

	for (cur = goal; cur != start; cur = prev_[start][cur]){

		stack[sp++] = cur;
        //cout<<cur<<endl;
        }
	stack[sp++] = start;



	while (sp--)

		printf("%d%c", stack[sp]+1, " \n"[!sp]);

}





int main() {

	while

		(cin >> V, V != 0) {

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				if (i == j) {

					dp[i][j] = 0;

				}

				else {

					dp[i][j] = INF;

				}

			}

		}

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				prev_[i][j] = i;

			}

		}

		vector<vector<int>>v(V, vector<int>(3));

		for (int i = 0; i < V; i++) {

			int a, b, c;

			cin >> a >> b >> c;

			v[i][0] = a-1;

			v[i][1] = b;

			v[i][2] = c;

			

		}

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				if (hypot(v[i][1] - v[j][1], v[i][2] - v[j][2]) <= 50.0) {

					dp[v[i][0]][v[j][0]] = hypot(v[i][1] - v[j][1], v[i][2] - v[j][2]);

				}

				else {

					continue;

				}

			}

		}

		Warshall_Floyd();

		int q;//クエリの数

		cin >> q;

		for (int i = 0; i < q; i++) {

			int s, g;

			cin >> s >> g;
        cout<<"get"<<endl;
			s--;

			g--;

			

			if (dp[s][g] == INF) {

				cout << "NA" << endl;

			}

			else {

				printPath2(s, g);

			}

			

		}



	}

	return 0;

}