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 <iomanip>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
 
using namespace std;
 
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define rep(i,n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
 

 
const int INF = 1000000;
const double EPS = 1e-8;
const int mod = 1e9 + 7;
const double INF_D = 1e18;

const double PI = acos(-1);

int dx[] ={-1,0,1,0};
int dy[] ={0,-1,0,1};

struct Edge
{
	int t;
	double c;
	Edge(){};
	Edge(int t, double c) : t(t), c(c){};
};

int n;
int b[1010], x[1010], y[1010];
vector<Edge> edge[1010];

pdi d[1010];
bool used[1010];
vi ans;

void dijkstra(int s){
	rep(i, 1010){
		d[i] = mp(INF_D, -1);
		used[i] = false;
	}
	d[s].fi = 0.0;
	priority_queue<pdi, vector<pdi>, greater<pdi> > q;
	pdi p;
	q.push(mp(0.0, s));
	int from, to;
	double cost;
	while(!q.empty()){
		p = q.top(); q.pop();
		from = p.se;
		//cost = p.fi;
		if(d[from].fi<p.fi) continue;
		cost = p.fi;
		used[from] = true;
		auto e = edge[from];
		for(int i = 0; i < e.size(); i++){
			to = e[i].t;
			//if(used[to]) continue;
			if(d[to].fi > cost+e[i].c){
				//if(to == 11) cout<<"  "<<from<<" "<< cost+e[i].c<<endl;
				d[to].fi = cost+e[i].c;
				d[to].se = from;
				q.push(mp(d[to].fi, to));
			}
		}
	}
}

double getDist2(int x1, int y1, int x2, int y2){
	int dx = x1-x2, dy = y1-y2;
	return sqrt(dx*dx+dy*dy);
}

int main(){
	int m, dx, dy;
	while(cin>>n && n){
		//cout<<n<<endl;
		rep(i, 1010){
			b[i]=x[i]=y[i] = -1;
			d[i] = mp(INF_D, -1);
			used[i] = false;
			edge[i].clear();
		}
		rep(i, n) cin>>b[i]>>x[i]>>y[i];
		for(int i = 0; i < 1010; i++){
			if(b[i] == -1 || x[i] == -1 || y[i]== -1) continue;
			for(int j = i + 1; j < 1010; j++){
				if(b[j] == -1 || x[j] == -1 || y[j] == -1) continue;
				dx = x[i]-x[j];
				dy = y[i]-y[j];
				if(dx*dx+dy*dy>2500)continue;
				edge[b[i]].push_back(Edge(b[j], sqrt(dx*dx+dy*dy)));
				edge[b[j]].push_back(Edge(b[i], sqrt(dx*dx+dy*dy)));
			}
		}
		//cout<<edge[1][0].t<<" "<<edge[1][0].c<<endl;
		//cout<<edge[2][0].t<<" "<<edge[2][0].c<<endl;

		cin>>m;
		rep(i, m){
			int s, g;
			cin>>s>>g;
			//cout<<s<<" "<<g<<endl;
			dijkstra(s);
			if(d[g].fi==INF_D) {
				cout<<"NA"<<endl;
				continue;
			}
			ans.clear();
			//bool usedG[1010]={};
			while(1){
				ans.pb(g);
				if(g == s /*|| g == -1*/) break;
				//usedG[g] = true;
				g = d[g].se;
				//if(usedG[g]) break;
				//cout<<"  "<<g<<endl;
			}
			//while(ans.size()> 0 && ans.back()==-1) ans.pop_back();
			reverse(all(ans));
			rep(j, ans.size()){
				if(j != 0) cout<<" ";
				cout<<ans[j];
			}
			cout<<endl;
			// for(int i = 1; i <= 22; i++){
			// 	cout<<" "<<i<<" "<<d[i].fi<<" "<<d[i].se<<endl;
			// }
			// for(int i = 0; i < edge[11].size(); i++){
			// 	if(edge[11][i].t == 6){
			// 		cout<<edge[11][i].c<<endl;
			// 	}
			// }

		}
	}
}

C++: #include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;

#define INF 10e6
#define X real()
#define Y imag()
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
typedef complex<double> P;


int n; //ビルの数
P build[1001]; //ビルの座標
double graph[1001][1001];//距離グラフ
double d[1001];  //最短距離
int prev[1001];  //経路
bool used[1001]; //	訪問済み

void initial(){
	for(int i=0;i<1001;i++)
		for(int j=0;j<1001;j++)
			graph[i][j]=(abs(build[i]-build[j]))<=50.0?abs(build[i]-build[j]):INF;
	return ;
}

void dijkstra(int s){
	fill(d,d+1001,INF);
	fill(used,used+1001,false);
	fill(prev,prev+1001,-1);
	d[s]=0;
	
	while(true){
		int v=-1;
		for(int u=0;u<n;u++){
			if(!used[u]&&(v==-1||d[u]<d[v]))v=u;
		}
		if(v==-1)
			break;
		used[v]=true;
		for(int u=0;u<n;u++){
			if(d[u]>d[v]+graph[u][v])
				d[u]=d[v]+graph[u][v],prev[u]=v;
		}
	}
	return ;
}

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

}

int main(){
	int tem,m;
	while(cin >> n,n){
		for(int i=0;i<n;i++)
			cin >>tem>> build[i].X>> build[i].Y;
		initial();
		cin >> m;
		for(int i=0;i<m;i++){
			int s,g,c;
			vector<int> root;
			cin >> s >> g;
			dijkstra(s-1);
			if(d[g-1]>=INF)
				cout << "NA" << endl;
			else{
				root=get_path(g-1);
				c=0;
				EACH(j,root)
					cout<< (c? " ":"") << (*j)+1,c++;
				cout << endl;
			}
		}
	}

return 0;
}