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 <memory>

using namespace std;

int x[1001], y[1001];
bool v[1001];
int p[1001];
int d[1001];
int edge[1001][1001];
int INF = (1 << 20);

void compute(int i, int j) {
  int temp = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
  if (temp <= 2500) edge[i][j] = temp;
}

void dijkstra(int s, int g, int n) {
  int mn,hozon,b, cnt = 0;
  int a[1001];

  // init
  
  for(int i = 0; i <= 1000; i++) {
    v[i] = false;
    p[i] = 0;
    d[i] = INF;
    a[i] = 0;
  }
  
  //cout << "init: " << v[1] << " " << p[5] << " " << d[7] << " " << a[8] << endl;

  //cout << "dijkstra in" << endl;
  d[s] = 0;

  for(;;) {
    mn = INF;

    //tmp=hozon;
    for(int i = 1; i <= n; i++) {
      if(mn > d[i] && !v[i]) {
	mn = d[i];
	hozon = i;
      }
    }
    //via[hozon]=tmp;
    if(mn == INF) break;

    v[hozon] = true;
    
    for(int j = 1; j <= n; j++) {
      if(d[j] > d[hozon] + edge[hozon][j] && !v[j]) {
	d[j] = edge[hozon][j] + d[hozon];
	p[j] = hozon;
	//cout<<p[j]<<" "<<j<<endl;
      }
    }
  }
  if(d[g] == INF) {
    cout << "NA" << endl;
  } else {
    b = p[g];// cout << "goal's p: " << p[g] << endl;
    while(1){
      // cout << "test" << endl;
      if (b == s){
	a[cnt++]=b;
	break;
      }
      a[cnt++] = b;
      b = p[b];
    }
    
    for(int i = cnt-1; i >= 0; i--) {
      cout << a[i] << " ";
    }
    cout <<g<< endl;
  }
}

int main (void) {
  int s, g;
  int n;
  int b, m;

  while(1) {
    
    cin >> n; if (n == 0) break;
    
    for(int i = 1; i <= n; i++) {
      cin >> b;
      cin >> x[b] >> y[b];
    }
    
    for(int i = 1; i <= 1000; i++) {
      for(int j = 1; j <= 1000; j++) {
	edge[i][j] = INF;
	if(i != j) compute(i, j);
      }
    }
    
    cin >> m; //cout << "m: " << m << endl;
    
    for(int i = 1; i <= m; i++) {
      cin >> s >> g;
      dijkstra(s, g, n);
    }
    
  }
  
  return 0;
}

C++: #include<stdio.h>
#include<stack>
#include<math.h>
using namespace std;
int dd[1000][1000];
int num[1000];
int inv[1001];
int x[1000];
int y[1000];
int vv[1000];
double nowt[1000];
int rev[1000];
int main(){
	int a;
	while(scanf("%d",&a),a){
		for(int i=0;i<a;i++){
			scanf("%d%d%d",num+i,x+i,y+i);
			inv[num[i]]=i;
		}
		for(int i=0;i<a;i++)
			for(int j=0;j<a;j++)
				dd[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
		int b;
		scanf("%d",&b);
		for(int i=0;i<b;i++){
			int c,d;
			scanf("%d%d",&c,&d);
			c=inv[c];d=inv[d];
			for(int j=0;j<a;j++){
				vv[j]=0;
				nowt[j]=999999999;
				rev[j]=-1;
			}
			nowt[c]=0;
			for(int j=0;j<a;j++){
				double M=99999999;
				int at=0;
				for(int k=0;k<a;k++){
					if(!vv[k]&&M>nowt[k]){
						M=nowt[k];
						at=k;
					}
				}
				if(M>90000000)break;
				//printf("%d\n",at);
				vv[at]=1;
				for(int k=0;k<a;k++){
					if(!vv[k]&&dd[at][k]<=2500&&nowt[k]>nowt[at]+sqrt(dd[at][k])){
						nowt[k]=nowt[at]+sqrt(dd[at][k]);
						rev[k]=at;
					}
				}
			}
			if(!vv[d])printf("NA\n");
			else {
				stack<int>S;
				int V=d;
				while(V!=c){
					S.push(V);
					V=rev[V];
				}
				printf("%d",num[c]);
				while(S.size()){
					printf(" %d",num[S.top()]);
					S.pop();
				}
				printf("\n");
			}
		}
	}
}

C++: #include <bits/stdc++.h>
#define INF 1000000000000LL
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int n;
ll G[101][101];

void dijkstra(int s,int g){
  ll D[101],from[101];
  from[g]=-1;
  from[s]=s;
  for(int i=0;i<101;i++) D[i]=INF;
  priority_queue<P,vector<P>,greater<P> > Q;
  D[s]=0;
  Q.push(P(0,s));
  while(!Q.empty()){
    P t=Q.top(); Q.pop();
    ll pos=t.second,cost=t.first;
    if(pos==g) break;
    if(D[pos]<cost) continue;
    
    for(int i=0;i<n;i++){
      if(G[pos][i]==-1)continue;
      if(cost+G[pos][i]<D[i]) {
	Q.push(P(cost+G[pos][i],i));
	D[i]=cost+G[pos][i];
	from[i]=pos;
      }
    }
  }

  if(from[g]==-1){cout<<"NA"<<endl;return;}
    
  vector<int> res;
  res.push_back(g);
  int pos=g;
  while(pos!=s){
    pos=from[pos];
    res.push_back(pos);
  }

  for(int i=0;i<res.size();i++){
    if(i) cout<<" ";
    cout<<res[res.size()-1-i]+1;
  }
  cout<<endl;
}



int main(){
  while(cin>>n,n){

  double x[101],y[101];
  for(int i=0;i<n;i++){
    int b;
    cin>>b;
    cin>>x[b-1]>>y[b-1];
  }
  
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++){
      ll X=(x[i]-x[j]);
      ll Y=(y[i]-y[j]);
      ll dis=X*X+Y*Y;
      if(dis>50*50)G[i][j]=-1;
      else G[i][j]=G[j][i]=dis;
    }
  
  
  int m;
  cin>>m;
  while(m--){
    int s,g;
    cin>>s>>g;
    dijkstra(s-1,g-1);
  }
  }
  return 0;
}