Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 2000000000

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		c_matrix := make([][]int, m)
		for i := range c_matrix {
			c_matrix[i] = make([]int, m)
		}
		t_matrix := make([][]int, m)
		for i := range t_matrix {
			t_matrix[i] = make([]int, m)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			c, _ := strconv.Atoi(buf_[2])
			t, _ := strconv.Atoi(buf_[3])
			c_matrix[a-1][b-1] = c
			c_matrix[b-1][a-1] = c
			t_matrix[a-1][b-1] = t
			t_matrix[b-1][a-1] = t
		}
		c_dist := make([][]int, m)
		c_prev := make([][]int, m)
		t_dist := make([][]int, m)
		t_prev := make([][]int, m)
		for i := 0; i < m; i++ {
			c_dist[i] = make([]int, m)
			c_prev[i] = make([]int, m)
			t_dist[i] = make([]int, m)
			t_prev[i] = make([]int, m)
		}
		for i := 0; i < m; i++ {
			for j := 0; j < m; j++ {
				if c_matrix[i][j] == 0 {
					c_dist[i][j] = INF
					c_prev[i][j] = -1
				} else {
					c_dist[i][j] = c_matrix[i][j]
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0 {
					t_dist[i][j] = INF
					t_prev[i][j] = -1
				} else {
					t_dist[i][j] = t_matrix[i][j]
					t_prev[i][j] = i
				}
			}
			c_dist[i][i] = 0
			t_dist[i][i] = 0
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					c_newlen := c_dist[i][k] + c_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
				}
			}
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if t_newlen < t_dist[i][j] {
						t_dist[i][j] = t_newlen
						t_prev[i][j] = t_prev[k][j]
					}

				}
			}
		}
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < k; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			p, _ := strconv.Atoi(buf_[0])
			q, _ := strconv.Atoi(buf_[1])
			r, _ := strconv.Atoi(buf_[2])
			switch r {
			case 0:
				fmt.Println(c_dist[p-1][q-1])
			case 1:
				fmt.Println(t_dist[p-1][q-1])
			}
		}
	}
}

C++: // 2014/06/16 Tazoe

#include <iostream>
using namespace std;

const int INF = 1000000000;

int main()
{
	while(true){
		int n, m;
		cin >> n >> m;

		if(n==0 && m==0)
			break;

		int C[100][100];
		int T[100][100];
		for(int i=0; i<m; i++){
			for(int j=0; j<m; j++){
				if(i==j){
					C[i][j] = T[i][j] = 0;
				}
				else{
					C[i][j] = T[i][j] = INF;
				}
			}
		}

		for(int i=0; i<n; i++){
			int a, b, c, t;
			cin >> a >> b >> c >> t;

			C[a-1][b-1] = C[b-1][a-1] = c;
			T[a-1][b-1] = T[b-1][a-1] = t;
		}
//???????????§????????£?????????
//????????????
		for(int k=0;k<m;k++){
			for(int i=0;i<7;i++){
				for(int j=0;j<m;j++){
					if(C[i][j]>C[i][k]+C[k][j]){
						C[i][j]=C[i][k]+C[k][j];
					}
				}
			}
		}
//????????????
		for(int k=0;k<m;k++){
			for(int i=0;i<7;i++){
				for(int j=0;j<m;j++){
					if(T[i][j]>T[i][k]+T[k][j]){
						T[i][j]=T[i][k]+T[k][j];
					}
				}
			}
		}
//???????????????
		int k;
		cin>>k;
		int A[k];
		for(int i=0;i<k;i++){
			int p,q,r;
			cin>>p>>q>>r;
		//	if(r==0)cout<<C[p][q]<<endl;
		//	if(r==1)cout<<T[p][q]<<endl;
			if(r==0)A[i]==C[p][q];
			if(r==1)A[i]==T[p][q];
		}
	//??????
		for(int i=0;i<k;i++){
			cout<<A[i]<<' ';
		}
//???????????????????????????
	cout<<endl;
	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1000000;
int cost[101][101],ttime[101][101];
int main(){
	int n,m;
	while(cin >> n >> m,n || m){
		int a,b,icost,itime,c,r;
		for(int i = 0;i <= m;++i){
			for(int j = 0;j <= m;++j){
				if(i == j) {
					cost[i][i] = 0;
					ttime[i][i] = 0;
				}
				else {
					cost[i][j] = INF;
					ttime[i][j] = INF;
				}
			}
		}
		for(int i = 0;i < n;++i){
			cin >> a >> b >> icost >> itime;
			cost[a][b] = cost[b][a] = icost;
			ttime[a][b] = ttime[b][a] = itime;
		}
		for(int k = 0;k <= m;++k){
			for(int i = 0;i <= m;++i){
				for(int j = 0;j <= m;++j){
					ttime[i][j] = min(ttime[i][j],ttime[i][k] + ttime[k][j]);
					cost[i][j] = min(cost[i][j],cost[i][k] + cost[k][j]);
				}
			}
		}
		cin >> c;
		for(int i = 0;i < c;++i){
			cin >> a >> b >> r;
			if(r == 1) cout << ttime[a][b] << endl;
			else cout << cost[a][b] << endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#define INF 10e6

using namespace std;

int main(void) {
	int n,m,k,p,q,r;
	int dp[101][101][2];
	while (cin >> n >> m && n && m) {
		for (int i = 0; i < m + 1; ++i) {
			for (int j = 0; j < m + 1; ++j) {
				for (int k = 0; k < 2; ++k) {
					if (i != j) {
						dp[i][j][k] = INF;
					}
					else {
						dp[i][j][k] = 0;
					}
				}
			}
		}

		int a,b;
		for (int i = 0; i < n; ++i) {
			cin >> a >> b >> dp[a][b][0] >> dp[a][b][1];
			dp[b][a][0] = dp[a][b][0];
			dp[b][a][1] = dp[a][b][1];
		}

		for (int mode = 0; mode < 2; ++mode) {
			for (int k = 1; k < m + 1; ++k) {
				for (int i = 1; i < m + 1; ++i) {
					for (int j = 1; j < m + 1; ++j) {
						dp[i][j][mode] = min(dp[i][j][mode], dp[i][k][mode]+dp[k][j][mode]);
					}
				}
			}
		}

		cin >> k;
		for (int i = 0; i < k; ++i) {
			cin >> p >> q >> r;
			cout << dp[p][q][r] << endl;
		}
	}
	return 0;
}

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

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

int N,M,K;
const int MAXN=128;
const int INF=1e9;
int G[2][MAXN][MAXN];

int dk(int from,int to,int type)
{
	bool ok[MAXN];
	int cost[MAXN];
	memset(ok,0,sizeof(ok));
	memset(cost,0,sizeof(cost));
	ok[from]=true;

	while(!ok[to])
	{
		int t,v=INF; 
		rep(i,M) if(ok[i]) rep(j,M) if(!ok[j]&&G[type][i][j])
		{
			if(cost[i]+G[type][i][j]<v){ v=cost[i]+G[type][i][j]; t=j; }
		}

		if(v==INF){ cout<<"ERROR"<<endl; break; } else { cost[t]=v; ok[t]=true; }
	}

	return cost[to];
}

int main()
{
	cin>>N>>M;
	int a,b,c,d;
	
	rep(i,N)
	{ 
		cin>>a>>b>>c>>d; --a; --b;
		G[0][a][b]=G[0][b][a]=c;
		G[1][a][b]=G[1][b][a]=d;
	}

	cin>>K;
	rep(i,K)
	{
		cin>>a>>b>>c; --a; --b;
		cout<<dk(a,b,c)<<endl;
	}


	return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n,m,k,a,b,c,d,li1[110][110],li2[110][110];

int main(){
	cin >> n >> m;
	REP(i,0,m) REP(j,0,m) if(i!=j) li1[i][j]=INF,li2[i][j]=INF;
	REP(i,0,n) cin >> a >> b >> c >> d,li1[a-1][b-1]=c,li1[b-1][a-1]=c,li2[a-1][b-1]=d,li2[b-1][a-1]=d;
	REP(k,0,m) REP(j,0,m) REP(i,0,m) li1[i][j]=min(li1[i][j], li1[i][k]+li1[k][j]),li2[i][j]=min(li2[i][j], li2[i][k]+li2[k][j]);
	cin >> k;
	REP(i,0,k){
		cin >> a >> b >> c;
		if(c) cout << li2[a-1][b-1] << endl;
		else cout << li1[a-1][b-1] << endl;
	}
	
	return 0;
}