Go: // Warshall–Floyd Algorithm

package main

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

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
					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++: #include <iostream>
using namespace std;

int main(void){
    while(true){
        int n, m;
        cin >> n >> m;
        if(n+m==0) break;
        int INF=1<<29;
        int cost[110][110], t[110][110];
        
        for(int i=1; i<=m; i++){
            for(int j=1; j<=m; j++){
                if(i==j){
                    cost[i][j]=0;
                    t[i][j]=0;
                }else{
                    cost[i][j]=INF;
                    t[i][j]=INF;
                }
            }
        }
        for(int i=0; i<n; i++){
            int a, b;
            cin >> a >> b;
            cin >> cost[a][b] >> t[a][b];
            cost[b][a]=cost[a][b];
            t[b][a]=t[a][b];
        }
        for(int k=1; k<=m; k++){
            for(int i=1; i<=m; i++){
                for(int j=1; j<=m; j++){
                    cost[i][j]=min(cost[i][j], cost[i][k]+cost[k][j]);
                    t[i][j]=min(t[i][j], t[i][k]+t[k][j]);
                }
            }
        }
        int k;
        cin >> k;
        while(k--){
            int p, q, r;
            cin >> p >> q >> r;
            cout << (r==0? cost[p][q]:t[p][q]) << "\n";
            
        }
    
    
    }
}

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

int main(){
  int n,m,a,b,cost,time,k,p,q,r;
  int t[100][100],c[100][100];

  for(;;){
    scanf("%d %d",&n,&m);
    if(!n && !m)break;

    for(int i=0;i<m;i++){
      for(int j=0;j<m;j++){
	if(i==j){
	  t[i][j] = 0;
	  c[i][j] = 0;
	}else{
	  t[i][j] = 1000000;
	  c[i][j] = 1000000;
	}
      }
    }

    for(int i=0;i<n;i++){
      scanf("%d %d %d %d",&a,&b,&cost,&time);
      t[a-1][b-1] = time;
      t[b-1][a-1] = time;
      c[a-1][b-1] = cost;
      c[b-1][a-1] = cost;
    }

    for(int x=0;x<m;x++){
      for(int i=0;i<m;i++){
	for(int j=0;j<m;j++){
	  t[i][j] = min(t[i][j],t[i][x] + t[x][j]);
	  c[i][j] = min(c[i][j],c[i][x] + c[x][j]);
	}
      }
    }

    scanf("%d",&k);
    for(int i=0;i<k;i++){
      scanf("%d %d %d",&p,&q,&r);
      if(r)printf("%d\n",t[p-1][q-1]);
      else printf("%d\n",c[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<m;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];
          if(T[i][j] > T[i][k]+T[k][j])
            T[i][j] = T[i][k] + T[k][j];
        }
      }
    }
    unsigned int k;
    cin >> k;
    for(int i=0;i<k;i++){
      int p,q,r;
      cin >> p >> q;
      if(k == 0  &&  q == 0)
        return 0;
      cin >> r;

      if(r==0){
        cout << C[p-1][q-1] << endl;
      } else {
        cout << T[p-1][q-1] << endl;
      }
    }
    break;
  }

	return 0;
}

C++: #include<iostream>
using namespace std;
#include<algorithm>
#include<string>
#define REP(i,a) for(int  i=0;i<a;i++)
int A[400][400];
int B[400][400];
int main(){
	int a,b=0,c=0,d,n,m;	
	cin>>n>>m;
	while(n!=0||m!=0){
	REP(i,m){
		REP(j,m){
			A[i][j]=1001;
			B[i][j]=1001;
		}
	}
	REP(i,n){
	cin>>a>>b>>c>>d;
	A[a-1][b-1]=c;
	B[a-1][b-1]=d;	
	A[b-1][a-1]=c;
	B[b-1][a-1]=d;
	}
	REP(i,m){
		REP(j,m){
	 		REP(k,m){
		A[i][j]=min(A[i][j],A[i][k]+A[k][j]);
		B[i][j]=min(B[i][j],B[i][k]+B[k][j]);
		A[j][i]=A[i][j];
		B[j][i]=B[i][j];		
			}
		}	
	}
	cin>>n;
	REP(i,n){
	cin>>a>>b>>c;
	if(c==0) cout<<A[a-1][b-1]<<endl;
	else cout<<B[a-1][b-1]<<endl;
	}
	cin>>n>>m;
	}
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 9999999
int dijkstra(int x,int y);
int D[128][128];/*Adjacency matrix*/
int n,m;
int main(){
	while(1){
		scanf("%d%d",&n,&m);
		if(n == 0 && m == 0)break;
		memset(D,0,sizeof(D));
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				if(i == j)continue;
				D[i][j] = INF;
			}
		}
		
		for(int i = 0; i < n; i++){
			int from,to,cst,tm;
			scanf("%d%d%d%d",&from,&to,&cst,&tm);
			D[from][to] = cst;
			D[to][from] = tm;
		}
		int k;
		scanf("%d",&k);
		for(int i = 0; i < k; i++){
			int from,to,x;
			scanf("%d%d%d",&from,&to,&x);
			(x == 0) ? printf("%d\n",dijkstra(from,to)) : printf("%d\n",dijkstra(to,from));
		}
	}
	return 0;
}
int dijkstra(int x,int y){
	int dist[128];
	bool done[128]={false};
	for(int i = 1; i <= m; i++){
		dist[i] = INF;
	}
	
	dist[x] = 0;
	int cost = 0;
	while(1){
		int e = -1;
		for(int i = 1; i <= m; i++){
			if(done[i] == false && (e == -1 || dist[i] < dist[e])){
				e = i;
			}
		}
		if(e == -1)break;
		done[e] = true;
		if(e == y){
			cost = dist[e];
			break;
		}
		
		for(int i = 1; i <= m; i++){
			dist[i] = min(dist[i],dist[e]+D[e][i]);
		}
		
	}
	
	if(cost == INF)return -1;
	else return cost;
}