Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

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
			t_matrix[a-1][b-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
				} else {
					c_dist[i][j] = c_matrix[i][j]
				}
				if c_matrix[i][j] == 0{
					c_prev[i][j] = -1
				} else {
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0{
					t_dist[i][j] = INF
				} else {
					t_dist[i][j] = t_matrix[i][j]
				}
				if t_matrix[i][j] == 0{
					t_prev[i][j] = -1
				} else {
					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++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s

int main()
{
	int n, m;
	while (cin >> n >> m, n)
	{
		int cost[105][105]; int time[105][105];
		REP(i, m)REP(j, m)
		{
			if (i == j)
			{
				cost[i][j] = 0;
				time[i][j] = 0;
			}
			else
			{
				cost[i][j] = INF;
				time[i][j] = INF;
			}
		}
		int a, b, c, t;
		REP(i, n)
		{
			cin >> a >> b >> c >> t;
			a--; b--;
			cost[a][b] = c; cost[b][a] = c;
			time[a][b] = t; time[b][a] = t;
		}
		REP(k, m)REP(i, m)REP(j, m)
		{
			cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
			time[i][j] = min(time[i][j], time[i][k] + time[k][j]);
		}
		int	q;
		cin >> q;
		REP(i, q)
		{
			cin >> a >> b >> c;
			a--; b--;
			if (c) cout << time[a][b] << endl;
			else cout << cost[b][a] << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<queue>
#include<algorithm>

using namespace std;

#define inf 1000000000

int n,m;
int C[101][101];
int T[101][101];

class S{
	public:
	int iti,now;
	S(){}
	S(int a,int b){iti=a;now=b;}
	bool operator < (const S &a)const{
		return now>a.now;
	}
};
int dike(int st,int en,int va){
	priority_queue<S> state;
	int sima[101];
	int visit[101]={0};
	for(int i=0;i<101;i++){
		sima[i]=inf;
	}
	state.push(S(st,0));
	sima[st]=0;
	while(1){
		S u;
		u=state.top();
		state.pop();
		visit[u.iti]=1;
		if(u.iti==en){
			return u.now;
		}
		
		for(int i=1;i<=m;i++){
			if(C[u.iti][i]==inf||visit[i]==1){
				continue;
			}
			if(u.now+C[u.iti][i] < sima[i]){
				int cost=C[u.iti][i];
				if(va==1){
					cost=T[u.iti][i];
				}
				sima[i]=sima[u.iti]+cost;
				state.push(S(i,sima[i]));
			}
		}
	}
}

int main(){
	while(1){
		cin>>n>>m;
		if(n==0)break;
		for(int i=0;i<101;i++){
			for(int j=0;j<101;j++){
				C[i][j]=inf;
				T[i][j]=inf;
			}
		}
		for(int i=0;i<n;i++){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			C[a][b]=C[b][a]=c;
			T[a][b]=T[b][a]=d;
		}
		
		int l;
		cin>>l;
		for(int i=0;i<l;i++){
			int a,b,c;
			cin>>a>>b>>c;
			printf("%d\n",dike(a,b,c));
		}
	}
}

C++: #include<iostream>
#include<queue>
#include<algorithm>

using namespace std;

#define inf 1000000000

int n,m;
int C[101][101];
int T[101][101];

class S{
	public:
	int iti,now;
	S(){}
	S(int a,int b){iti=a;now=b;}
	bool operator < (const S &a)const{
		return now>a.now;
	}
};
int dike(int st,int en,int va){
	priority_queue<S> state;
	int sima[101];
	int visit[101]={0};
	for(int i=0;i<101;i++){
		sima[i]=inf;
		visit[i]=0;
	}
	state.push(S(st,0));
	sima[st]=0;
	while(1){
		S u;
		u=state.top();
		state.pop();
		visit[u.iti]=1;
		if(u.iti==en){
			return u.now;
		}
		
		for(int i=1;i<=m;i++){
			if(C[u.iti][i]==inf||visit[i]==1){
				continue;
			}
			if(sima[u.iti]+C[u.iti][i] < sima[i]){
				int cost=C[u.iti][i];
				if(va==1){
					cost=T[u.iti][i];
				}
				sima[i]=sima[u.iti]+cost;
				state.push(S(i,sima[i]));
			}
		}
	}
}

int main(){
	while(1){
		cin>>n>>m;
		if(n==0)break;
		for(int i=0;i<101;i++){
			for(int j=0;j<101;j++){
				C[i][j]=inf;
				T[i][j]=inf;
			}
		}
		for(int i=0;i<n;i++){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			C[a][b]=C[b][a]=c;
			T[a][b]=T[b][a]=d;
		}
		
		int l;
		cin>>l;
		for(int i=0;i<l;i++){
			int a,b,c;
			cin>>a>>b>>c;
			printf("%d\n",dike(a,b,c));
		}
	}
}

C++: #include <iostream>
#include <cmath>
#include <cstring>
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define pb push_back
using namespace std;

const int INF=10000000;
int V;
int d[2][111][111];

void wf(){
    FOR(k,0,V+1)FOR(i,0,V+1)FOR(j,0,V+1){
        d[0][i][j]=min(d[0][i][j],d[0][i][k]+d[0][k][j]);
        d[1][i][j]=min(d[1][i][j],d[1][i][k]+d[1][k][j]);
    }
}

int main(){
    int n;
    while(1){
        cin>>n>>V;
        if(!(n||V)) break;
        FOR(i,0,V+1)FOR(j,0,V+1){
            d[0][i][j]=d[1][j][i]=INF;
        }
        FOR(i,0,n){
            int a,b,m,t;cin>>a>>b>>m>>t;
            d[0][a][b]=d[0][b][a]=t;
            d[1][a][b]=d[1][b][a]=m;
        }
        wf();
        int k;cin>>k;
        FOR(i,0,k){
            int p,q,r;cin>>p>>q>>r;
            cout<<d[r][p][q]<<endl;
        }
    }
}

C++: #include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main(void) {
	int n,m,k,p,q,r;
	while (cin >> n >> m && n && m) {
		int dp[101][101][2];
		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] = 0;
					}
					else {
						dp[i][j][k] = 2001;
					}
				}
			}
		}

		int a,b,c,t;
		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;
}