Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
	)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		matrix := make([][]int, 10)
		for i := range matrix {
			matrix[i] = make([]int, 10)
		}
		for i := range matrix {
			for j := range matrix[i] {
				if i == j {
					matrix[i][j] = 0
				} else {
					matrix[i][j] = INF
				}
			}
		}
		num := 0
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			from, _ := strconv.Atoi(buf[0])
			to, _ := strconv.Atoi(buf[1])
			cost, _ := strconv.Atoi(buf[2])
			if num < from {
				num = from
			}
			if num < to {
				num = to
			}
			matrix[from][to] = cost
			matrix[to][from] = cost
		}
		num++
		for i := 0; i < num; i++ {
			for j := 0; j < num; j++ {
				for k := 0; k < num; k++ {
					if matrix[j][i]+matrix[i][k] < matrix[j][k] {
						matrix[j][k] = matrix[j][i]+matrix[i][k]
					}
				}
			}
		}
		ans, sum := 0, INF
		for i := 0; i < num; i++ {
			now := 0
			for j := 0; j < num; j++ {
				now += matrix[i][j]
			}
			if sum > now {
				sum = now
				ans = i
			}
		}
		fmt.Println(ans, sum)
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

// BEGIN_LIBRARY ///////////////////
#define MAX_V (1000)
#define INF (999999)

namespace NLibrary{
	class Dijkstra {
	private:
		int cost[MAX_V][MAX_V];
		int d[MAX_V];
		bool used[MAX_V];
		int V;
	public:
		Dijkstra() {
			for (int i = 0; i < MAX_V; i++) {
			  fill(cost[i], cost[i] + MAX_V, INF);
			}
		}

		void setV(int V) {
			this->V = V;
		}

		void setCost(int a, int b, int c, bool bidirect = false) {
			this->cost[a][b] = c;
			if (bidirect) {
				this->cost[b][a] = c;
			}
		}

		void calc(int s) {
			// s??????????????????????????¢????±???????
			fill(d, d + MAX_V, INF); 
			fill(used, used + MAX_V, false);
			d[s] = 0;
			while (true) {
				int v = -1;
				for (int u = 0; u < V; u++) {
					if (!used[u] && (v == -1 || d[u] < d[v])) {
						v = u;
					}
				}

				if (v == -1) break;
				used[v] = true;
				for (int u = 0; u < V; u++) {
					d[u] = min(d[u], d[v] + cost[v][u]);
				}
			}
		}

		int getL(int a) {
			return d[a];
		}
	};

}

// END_LIBRARY ////////////////////

int main() {
	NLibrary::Dijkstra dijkstra;
	int n;
	bool flag[100];
	while (cin >> n, n != 0) {
		fill(flag, flag + 100, false);
		for (int i = 0; i < n; i++) {
			int a, b, c;
			cin >> a >> b >> c;
		  dijkstra.setCost(a, b, c, true);
			flag[a] = true;
			flag[b] = true;
		}
		int V = 0;
		for (int i = 0; i < 100; i++) {
			if (flag[i] == true) {
				V++;
			}
		}
		dijkstra.setV(V);
		for (int i = 0; i < n; i++) {
			
		}
		int m = INF, town = -1;
		for (int i = 0; i < V; i++) {
			int sum = 0;
			dijkstra.calc(i);
			for (int j = 0; j < V; j++) {
				sum += dijkstra.getL(j);
			}

			if (sum < m) {
				town = i;
				m = sum;
			}
		}
		cout << town << " " << m << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <queue>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <sstream>
#include <iostream>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <functional>
#include <string.h>
using namespace std;
const int INF = 1000000000;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,start,end) for(int i=(start);i<(end);++i)
#define pint(i) printf("%d\n",(i))
#define pint2(i,j) printf("%d %d\n",(i),(j))
#define pint3(i,j,k) printf("%d %d %d\n",(i),(j),(k))
#define gint(i) scanf("%d",&(i))
#define gint2(i,j) scanf("%d %d",&(i),&(j))
#define gint3(i,j,k) scanf("%d %d %d",&(i),&(j),&(k))
#define init(tar,val) memset((tar),(val),sizeof((tar)))
#define show(tar,len) for(int i=0;i<(len);++i) \
	cout<<tar[i]<<' ';\
	cout<<endl;




class bignum{
public:
	bignum(int size = 4) :len(size){
	}
	~bignum(){
	}
	int size()const{
		return len;
	}
	//int get(int id)const{
	//	return num[id];
	//}
	friend ostream &operator<<(ostream &output, const bignum &b){
		bool stu = false;
		for (int i = int(b.len - 1); i >= 0; --i){
			if (stu)
				printf("%09d", b.num[i]);
			else if (b.num[i] > 0){
				printf("%d", b.num[i]);
				stu = true;
			}
		}
		if (stu == false)
			printf("0");
		return output;
	}
	const bignum& operator+=(const bignum&right){
		int add = 0;
		for (int i = 0; i < len; ++i){
			int tmp = 0;
			if (i < right.size()){
				tmp = right.num[i] + num[i] + add;
			}
			else{
				tmp = num[i] + add;
			}
			num[i] = tmp%gap;
			add = tmp / gap;
		}
		return *this;
	}
	const bignum& operator=(const bignum&right){
		for (int i = 0; i < len; ++i){
			num[i] = right.num[i];
		}
		return *this;
	}
	void set(int a){
		for (int i = 0; i < len; ++i){
			num[i] = a%gap;
			a /= gap;
		}
	}
private:
	int  num[4];
	int len;
	static const int gap = 1000000000;
};


//inline int id(int i){
//	return i & 1;
//}
//
//inline int last(int i){
//	return (i - 1) & 1;
//}
//
//void myshow(int i){
//	rep(j, 0, ){
//		cout << dp[id(i)][j] << ' ';
//	}
//	cout << endl;
//}


//#define my_debug

const int MAX_NUM = 15;

int n;
int len[MAX_NUM][MAX_NUM];
int stu[MAX_NUM];
set<int> cache;
void myinit(){
	rep(i, 0, MAX_NUM)
		rep(j, 0, MAX_NUM){
		if (i == j)
			len[i][j] = 0;
		else
			len[i][j] = INF;
	}
}


void solve(){
	rep(i, 0, MAX_NUM){
		rep(j, 0, MAX_NUM){
			rep(k, 0, MAX_NUM){
				len[i][j] = min(len[i][j], len[i][k] + len[k][j]);
			}
		}
	}
	int out = INF, t = 0;
	for (int i : cache){
		int tmp = 0;
		for (int j : cache){
			tmp += len[i][j];
		}
		if (tmp < out){
			out = tmp;
			t = i;
		}
	}
	pint2(t, out);
}

int main(){
#ifdef my_debug
	freopen("a.in", "r", stdin);
#endif
	while (gint(n) != EOF){
		if (n == 0)
			break;
		fill(stu, stu + MAX_NUM, INF);
		myinit();
		cache.clear();
		int tmp1, tmp2;
		rep(i, 0, n){
			gint2(tmp1, tmp2);
			int tmp;
			gint(tmp);
			len[tmp2][tmp1] = len[tmp1][tmp2] = tmp;
			cache.insert(tmp1);
			cache.insert(tmp2);
		}
		solve();
	}
	return 0;
}

C++: #include <iostream>
#include <cstring>
using namespace std;
const int maxn=11,INF=0x3f3f3f3f;
int e[maxn][maxn];
int main(){
	freopen("in.txt","r",stdin);
	int m;
	while(cin>>m,m){
		for(int i=0;i<maxn;i++){
			for(int j=0;j<maxn;j++){
				e[i][j]=INF;
			}
		}
		int n=0;
		for(int i=0;i<m;i++){
			int u,v,w;
			cin>>u>>v>>w;
			n=max(n,u);
			n=max(n,v);
			e[u][v]=e[v][u]=w;
		}
		++n;
		for(int k=0;k<n;k++){
			for(int i=0;i<n;i++)
				for(int j=0;j<n;j++)
						e[i][j]=min(e[i][k]+e[k][j],e[i][j]);
		}
		int s=0,mis=INF,mii;
		for(int i=0;i<n;i++){
			s=0;
			for(int j=0;j<n;j++){
				if(i!=j){
					s+=e[i][j];
				}
			}
			if(s<mis){
				mii=i;
				mis=s;
			}
		}
		cout<<mii<<' '<<mis<<endl;
	}
	return 0;
}