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 <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int n;//ビルの数
int m;//移動情報の個数
const int INF = 1e+9;
typedef pair<int,int> P;
int d[1001];//2点間の最短距離
int prev[1001];//直前の頂点
bool used[1001];
int cost[1001][1001];

void dijkstra(int s){
  fill(d,d+1000,INF);
  fill(used,used+1000,false);
  d[s] = 0;
  while(1){
    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]+cost[v][u]){
      d[u] =d[v]+cost[v][u];
      prev[u] = v;
    }
  }
  }
}
int main()
{
  while(cin>>n){
    for(int i = 0;i <=1000;i++){
      for(int j = 0;j <=1000;j++){
	cost[i][j] = INF;
      }
    }
    map<int,P> build;
    build.clear();
    int b,x,y;
    for(int i = 0;i <n;i++){
      cin>>b>>x>>y;
      b--;
      build[b]=P(x,y);
    }
    for(int i = 0;i <=1000;i++){
      for(int j = 0;j <=1000;j++){
	if(i!=j)
	  cost[i][j] =INF;
	else
	  cost[i][j] = 0;
      }
    }
    
    for(int i = 0;i <n-1;i++){//距離が50以下の距離なら道があるとする。
      for(int j = i+1;j <n;j++){
	int d =(build[i].first-build[j].first)*(build[i].first-build[j].first)+(build[i].second-build[j].second)*(build[i].second-build[j].second);
	if(d<=2500){
	  cost[i][j] = 1;
	  cost[j][i] = 1;
	}
      }
    }
    
    cin>>m;
    int s,g;//スタートとゴール
    stack<int> path;
    cout <<"テス"<<endl;
    for(int i = 0;i <m;i++){
      cin>>s>>g;
      s--;
      g--;
      dijkstra(s);
      if(d[g]!=INF){
	for(int j =g;j !=s;j =prev[j]){
	  path.push(j);
	}
	path.push(s);
	int k=	path.size();
	for(int j = 0;j <k;j++){
	  cout <<path.top()+1;
	  path.pop();
	  if(j==k-1)
	    cout <<endl;
	  else
	    cout <<" ";
	}
      }
      else{
	cout <<"NA"<<endl;
      }
    }
  }
  return 0;
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>

using namespace std;

struct Point{
	double x,y;
};

int main(){

	int n,m,checkTable[101],path[101],id,start,goal,count,min_index;
	double distance[101][101],x,y,calc[101][101],min_value;
	bool canGO[101];
	Point table[101];
	stack<int> S;

	while(true){
		scanf("%d",&n);
		if(n == 0)break;

		for(int i=1; i <= n; i++){
			scanf("%d %lf %lf",&id,&x,&y);
			table[id].x = x;
			table[id].y = y;
		}

		for(int i = 1; i <= n; i++){
			for(int k = 1; k <= n; k++){
				distance[i][k] = sqrt((table[i].x-table[k].x)*(table[i].x-table[k].x)+(table[i].y-table[k].y)*(table[i].y-table[k].y));
			}
		}

		scanf("%d",&m);

		for(int i = 1; i <= m; i++){
			scanf("%d %d",&start,&goal);

			for(int k = 1; k <= n; k++){
				checkTable[k] = 0;
				if(distance[start][k] < 50 || fabs(distance[start][k] - 50) < 0.00000001){
					canGO[k] = true;
				}else{
					canGO[k] = false;
				}
				path[k] = start;
				for(int p = 1; p <= n; p++)calc[k][p] = distance[k][p];
			}

			count = 1;
			checkTable[start] = 1;

			while(count < n){
				min_value = 1000000000;

				for(int k = 1; k <= n; k++){
					if(checkTable[k] == 0 && canGO[k] == true && calc[start][k] < min_value){
						min_value = calc[start][k];
						min_index = k;
					}
				}

				if(min_value == 1000000000)break;

				checkTable[min_index] = 1;
				count++;

				for(int p = 1; p <= n; p++){
					if((canGO[p] == false || calc[start][p] > calc[start][min_index]+calc[min_index][p]) && (distance[min_index][p] < 50 || fabs(distance[min_index][p] - 50) < 0.00000001)){
						calc[start][p] = calc[start][min_index]+calc[min_index][p];
						canGO[p] = true;
						path[p] = min_index;
					}
				}
			}

			if(canGO[goal] == false)printf("NA\n");
			else{
				int t = goal;
				while(true){
					S.push(t);
					t = path[t];
					if(t == start)break;
				}
				printf("%d",start);
				while(!S.empty()){
					printf(" %d",S.top());
					S.pop();
				}
				printf("\n");
			}
		}
	}


	return 0;
}