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<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#define M 2100000
using namespace std;
int main(void)
{
	int i,j,n,k,m,a[1001],b[1001],cost[1001],time[1001],kk,pp;
	int p[201],q[201],r[201];
	int kin[101][101],zi[101][101];
	int flg[10001],leng[10001],min;
	int kaku,skin,szi;
	scanf("%d %d",&n,&m);
	for(i=1;i<=n;i++) scanf("%d %d %d %d",&a[i],&b[i],&cost[i],&time[i]);
	
	
	/**/
	//??£??\????????????  ??????
	for(i=1;i<=m;i++) {
		for(j=1;j<=m;j++) {
			kin[i][j]=M;
		}
	}
	for(i=1;i<=m;i++) kin[i][i]=0;
	for(i=1;i<=n;i++) {
		kin[a[i]][b[i]]=cost[i];
	}
	//??£??\???????????????
	for(i=1;i<=m;i++) {
		for(j=1;j<=m;j++) {
			zi[i][j]=M;
		}
	}
	for(i=1;i<=m;i++) zi[i][i]=0;
	for(i=1;i<=n;i++) {
		zi[a[i]][b[i]]=time[i];
	}
	/**/
		
	scanf("%d",&k);
	for(i=1;i<=k;i++) {
		scanf("%d %d ",&p[i],&q[i]);
		if(p[i]==0 && q[i]==0) break;
		scanf("%d",&r[i]);
	}
	
	for(i=1;i<=k;i++) {
		for(j=1;j<=m;j++) {
			leng[j]=M;
			flg[j]=0;
		}
		pp=p[i];
		leng[pp]=0;
		
		if(r[i]==0) {
			for(j=1;j<=m;j++) {
				min=M;
				for(kk=1;kk<=m;kk++) {
					if(flg[kk]==0 && leng[kk]<min) {
						kaku=kk;
						min=leng[kk];
					}
				}
				
				flg[kaku]=1;
				
				for(kk=1;kk<=m;kk++) {
					if((leng[kaku]+kin[kaku][kk])<leng[kk]) leng[kk]=leng[kaku]+kin[kaku][kk];
				}
			}
//			for(j=1;j<=m;j++) printf("kin %d--%d=%d\n",pp,j,leng[j]);
			printf("%d\n",leng[q[i]]);
		}
		else {
			for(j=1;j<=m;j++) {
				min=M;
				for(kk=1;kk<=m;kk++) {
					if(flg[kk]==0 && leng[kk]<min) {
						kaku=kk;
						min=leng[kk];
					}
				}
				flg[kaku]=1;
				for(kk=1;kk<=m;kk++) {
					if((leng[kaku]+zi[kaku][kk])<leng[kk]) leng[kk]=leng[kaku]+zi[kaku][kk];
				}
			}
			printf("%d\n",leng[q[i]]);
//			for(j=1;j<=m;j++) printf("zi %d--%d=%d\n",pp,j,leng[j]);
		}
//		printf("\n");
	}

/*	//cost
	printf("??????\n");
	printf("      ");
	for(i=1;i<=m;i++) printf("%7d ",i);
	printf("\n");
	printf("\n");
	for(i=1;i<=m;i++) {
		printf("%7d  ",i);
		for(j=1;j<=m;j++) {
			printf("%7d ",kin[i][j]);
		}
		printf("\n");
	}
	printf("\n");
	printf("\n");
	//time
	printf("??????\n");
	printf("      ");
	for(i=1;i<=m;i++) printf("%7d ",i);
	printf("\n");
	printf("\n");
	for(i=1;i<=m;i++) {
		printf("%7d  ",i);
		for(j=1;j<=m;j++) {
			printf("%7d ",zi[i][j]);
		}
		printf("\n");
	}
	printf("\n");*/
	return 0;
}

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

int main(){
  while(true){
    int n,m;
    cin >> n >> m;
    if(n==0 && m==0){
      break;
    }
    //m=m+1;

    int INF=100000;
    int way_co[m][m];
    int way_ti[m][m];
    for(int i=0; i<m; i++){
      for(int j=0; j<m; j++){
        way_co[i][j] = INF;
        way_ti[i][j] = INF;
        if(i==j){
          way_co[i][j] = 0;
          way_ti[i][j] = 0;
        }
      }
    }

    int a,b,cost,tim;
    for(int i=0; i<n; i++){
      cin >> a >> b >> cost >> tim;
      way_co[a-1][b-1] = cost;
      way_ti[a-1][b-1] = tim;
    }

    int d_co[m][m];
    int d_ti[m][m];
    for(int i=0; i<m; i++){
      for(int j=0; j<m; j++){
        d_co[i][j] = way_co[i][j];
        d_ti[i][j] = way_ti[i][j];
      }
    }


    for(int k=0; k<m; k++){
      for(int i=0; i<m; i++){
        for(int j=0; j<m; j++){
          if(d_co[i][j] > d_co[i][k] + d_co[k][j]){
            d_co[i][j] = d_co[i][k] + d_co[k][j];
          }
          if(d_ti[i][j] > d_ti[i][k] + d_ti[k][j]){
            d_ti[i][j] = d_ti[i][k] + d_ti[k][j];
          }
        }
      }
    }
    int y;
    cin >> y;
    for(int i=0; i<y; i++){
      int a,b,c;
      cin >> a >> b >> c;
      if(c==0){
        cout << d_co[a-1][b-1] << endl;
      }else{
        cout << d_ti[a-1][b-1] << endl;
      }
    }
  }
  return 0;
}

C++: #include<iostream>
#define INF 2 << 20
using namespace std;
int main(){
  int n,m;
  cin >> n >> m;
  int cost[m+1][m+1];
  int time[m+1][m+1];

  for(int i=0;i<=m;i++)
    for(int j=0;j<=m;j++)
      cost[i][j] = time[i][j] = INF;

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

  for (int i = 1; i <= m; i++)      // ?????±????????????
    for (int j = 1; j <= m; j++)    // ????§???????
      for (int k = 1; k <= m; k++){  // ??????
        cost[j][k] = min(cost[j][k], cost[j][i] + cost[i][k]);
        time[j][k] = min(time[j][k], time[j][i] + time[i][k]);
      }


  int k;
  cin >> k;
  int p,q,r;
  while(cin>>p>>q){
    if(p==0&&q==0) break;
    cin >> r;
    switch(r){
    case 0: cout << cost[p][q] << endl; break;
    case 1: cout << time[p][q] << endl; break;
    default: break;
    }
  }
return 0;
}