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++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_C&lang=jp

#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;
				}
				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;
	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;
			s--;
			g--;
			
			if (dp[s][g] == INF) {
				cout << "NA" << endl;
			}
			else {
				printPath2(s, g);
			}
			
		}

	}
	return 0;
}

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

#define rep(i, n)for((i) = 0;(i) < (n);++(i))

struct buil{
	int n;
	string b;
	double x, y;
	void next(void){
		cin >> b >> x >> y;
		n = 0;
		int i; rep(i, b.size())n = n * 10 + b[i] - '0';
		return;
	}
};

bool nsort(buil qwe, buil rty){ return qwe.n < rty.n; }
buil B[100];
string G[100][100];
string ma = "#";

int main(void){
	int i, j, k, n, m;
	rep(i, 10)ma += ma;
	for(;;){
		scanf("%d", &n);
		if(!n)break;
		rep(i, n)rep(j, n)G[i][j] = ma;

		rep(i, n)B[i].next();
		sort(B, B + n, nsort);

		rep(i, n)rep(j, n){
			double tmp = (B[i].x - B[j].x) * (B[i].x - B[j].x) + (B[i].y - B[j].y) * (B[i].y - B[j].y);
			if(tmp <= 2500.0)G[i][j] = B[i].b;
		}
		rep(k, n)rep(i, n)rep(j, n)if(G[i][j].size() > G[i][k].size() + G[k][j].size())G[i][j] = G[i][k] + " " + G[k][j];

		scanf("%d", &m);
		for(;m--;){
			scanf("%d %d", &i, &j);
			if(G[i - 1][j - 1] != ma)cout << G[i - 1][j - 1] << " " << B[j - 1].b << endl;
			else puts("NA");
		}
	}
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <math.h>

using namespace std;

const int MAX = 1000;

struct int2
{
	int x;
	int y;
};

class Node
{
public:
	int id;
	double cost;
	int parent;
	bool visited;
	vector<int> edge_to;
	vector<double> edge_cost;

	Node() {}
	Node(int id) : id(id), cost(-1.0), parent(-1), visited(false) {}
	
	bool operator < (const Node& n) const
	{
		return cost > n.cost;
	}
};

int n, m;
Node nodes[MAX];
int2 pos[MAX];
int sid, gid;

void solve()
{
	priority_queue<Node> q;
	nodes[sid].cost = 0.0;
	q.push(nodes[sid]);
	
	while(!q.empty())
	{
		Node nn = q.top();
		q.pop();
		
		if(nn.visited) continue;
		if(nn.id==gid) return;
		nn.visited = true;
		for(int i=0; i<nn.edge_to.size(); i++)
		{
			int to = nn.edge_to[i];
			double cost = nn.cost + nn.edge_cost[i];
			if(nodes[to].cost > cost || nodes[to].cost < 0.0)
			{
				if(nodes[to].visited) continue;
				nodes[to].cost = cost;
				nodes[to].parent = nn.id;
				q.push(nodes[to]);
			}
		}
	}
}

void reset()
{
	for(int i=0; i<n; i++)
	{
		nodes[i].cost = -1;
		nodes[i].parent = -1;
		nodes[i].visited = false;
	}
}

int main(int argc, char** argv)
{
	int b, x, y;
	while(cin >> n, n)
	{
		for(int i=0; i<n; i++)
		{
			cin >> b >> x >> y;
			int2 tmp = {x, y};
			pos[b-1] = tmp;
			nodes[i] = Node(i);
		}
		
		for(int i=1; i<n; i++)
		{
			for(int j=0; j<i; j++)
			{
				int dx = pos[i].x - pos[j].x;
				int dy = pos[i].y - pos[j].y;
				double dist =  sqrt((double)(dx*dx + dy*dy));
				if(dist <= 50.0)
				{
					nodes[i].edge_to.push_back(j);
					nodes[i].edge_cost.push_back(dist);
					nodes[j].edge_to.push_back(i);
					nodes[j].edge_cost.push_back(dist);
				}
			}
		}
		
		cin >> m;
		
		for(int k=0; k<m; k++)
		{
			cin >> sid >> gid;
			sid = sid - 1;
			gid = gid - 1;
			
			solve();
		
			vector<int> way;
			way.push_back(gid);
			Node nn =nodes[gid];
			while(nn.parent != -1)
			{
				way.push_back(nn.parent);
				nn = nodes[nn.parent];
			}
		
			if(way.size() > 1)
			{
				for(int i=0; i<way.size(); i++)
				{
					if(i!=0) cout <<" ";
					cout << way[way.size() - i -1] + 1;
				}
			}
			else
			{
				cout << "NA";
			}
			cout << endl;
		}
	}
}