Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

var infty = 1000000000

type DirectedGraphNodeID int

type DirectedGraphNode struct {
	key         DirectedGraphNodeID
	adjacents   []*DirectedGraphNode
	costs       []int
	distance    int
	predecessor *DirectedGraphNode
}

func newDirectedGraph(nNodes int) *DirectedGraph {
	graph := DirectedGraph{}
	graph.nodes = make([]*DirectedGraphNode, nNodes)
	for i := 0; i < nNodes; i++ {
		node := DirectedGraphNode{}
		node.key = DirectedGraphNodeID(i)
		node.distance = infty
		graph.nodes[i] = &node
	}
	return &graph
}

type DirectedGraph struct {
	nodes []*DirectedGraphNode
}

func (g *DirectedGraph) setAdjacency(i, j DirectedGraphNodeID, cost int) {
	g.nodes[i].adjacents = append(g.nodes[i].adjacents, g.nodes[j])
	g.nodes[i].costs = append(g.nodes[i].costs, cost)
}

func (g *DirectedGraph) print() {
	for i := 0; i < len(g.nodes); i++ {
		node := g.nodes[i]
		key := node.key
		strings := []string{strconv.Itoa(int(key)), strconv.Itoa(node.distance)}
		for j := 0; j < len(node.adjacents); j++ {
			nodeJ := fmt.Sprintf("(%v, %v)", node.adjacents[j].key, node.costs[j])
			strings = append(strings, nodeJ)
		}
		fmt.Printf("%v\n", strings)
	}
}

func (g *DirectedGraph) relaxEdge(l, r *DirectedGraphNode, w int) {
	if r.distance > l.distance+w {
		// fmt.Printf("%v -> %v, %v\n", l.key, r.key, l.distance+w)
		r.distance = l.distance + w
		r.predecessor = l
	}
}

func main() {
	scanner.Split(bufio.ScanWords)

	nNodes := nextInt()
	graph := newDirectedGraph(nNodes)

	for i := 0; i < nNodes; i++ {
		iNode := DirectedGraphNodeID(nextInt())
		nAdjacent := nextInt()
		for j := 0; j < nAdjacent; j++ {
			jNode := DirectedGraphNodeID(nextInt())
			cost := nextInt()
			graph.setAdjacency(iNode, jNode, cost)
		}
	}

	graph.nodes[0].distance = 0
	for iNode := 0; iNode < nNodes; iNode++ {
		for iLeft := 0; iLeft < len(graph.nodes); iLeft++ {
			nodeLeft := graph.nodes[iLeft]
			for iRight := 0; iRight < len(nodeLeft.adjacents); iRight++ {
				nodeRight := nodeLeft.adjacents[iRight]
				cost := nodeLeft.costs[iRight]
				graph.relaxEdge(nodeLeft, nodeRight, cost)
			}
		}
	}

	// graph.print()

	for iNode := 0; iNode < len(graph.nodes); iNode++ {
		node := graph.nodes[iNode]
		fmt.Println(node.key, node.distance)
	}
}

C++: #include<bits/stdc++.h>
using namespace std;

#define int long long

int e[111][111],d[111];
int used[111];

signed main(){
  int n;
  cin>>n;
  int INF=1LL<<55LL;
  for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
      e[i][j]=INF;
  for(int i=0;i<n;i++){
    int u,k;
    cin>>u>>k;
    for(int j=0;j<k;j++){
      int v,c;
      cin>>v>>c;
      e[u][v]=min(e[u][v],c);
    }
  }
  memset(used,0,sizeof(used));
  for(int i=0;i<n;i++) d[i]=INF;
  d[0]=0;
  while(1){
    int u=-1;
    for(int i=0;i<n;i++){
      if(used[i]) continue;
      if(d[i]==INF) continue;
      if(u<0||d[i]<d[u]) u=i;
    }
    if(u<0) break;
    used[u]=1;
    for(int i=0;i<n;i++){
      d[i]=min(d[i],d[u]+e[u][i]);
    }
  }
  for(int i=0;i<n;i++) cout<<i<<" "<<d[i]<<endl;
  return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;

const int NOTV = 0;
const int VIST = 1;
const int NMAX = 100;
const int VMAX = 2000;
const int NILL = -1;
const int INF = 1 << 21;
int a[NMAX][NMAX];  //??£??\??????
int n;
//priority_queue <greater<int>> pq;

void dijkstra(){

	int p[NMAX];
	int d[NMAX];
	int vst[NMAX];
	int minc;
	for (int i = 0; i < n; i++) {
		vst[i] = NOTV;
		d[i] = INF;
	}
	d[0] = 0;
	p[0] = -1;
	while (1) {
		minc = INF;
		int u;
		for (int i = 0; i < n; i++) {
			if (minc > d[i] && vst[i]==NOTV) {
				u = i;
				minc = d[i];
			}
		}
		if (minc == INF) break;
		vst[u] = VIST;
		for (int v = 0; v < n; v++) {
			if (vst[v] == NOTV && a[u][v] != INF) {
				if (d[u] + a[u][v] < d[v]) {
					d[v] = d[u] + a[u][v];
					vst[v] = NOTV;
				}
			}

		}
	}
	for (int i = 0; i < n; i++) {
		cout << i << ' ' << ((d[i] == INF) ? -1 : d[i]) << endl;
	}
}

int main() {
	cin >> n;
	int um;
	int uo;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			a[i][j] = INF;
		}
	}
	for (int i = 0; i < n; i++) {
		cin >> um;
		int k;
		cin >> k;
		for (int j = 0; j < k; j++) {
			cin >> uo;
			cin >> a[um][uo];
		}
		
	}
	
	dijkstra();
	return 0;
}

C++: import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static int N;
	static int W[][], distance[], state[];
	static final int INF = 1000000000;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();

		W = new int[N][N];
		distance = new int[N];
		state = new int[N];

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				W[i][j] = INF;
			}
		}

		for (int i = 0; i < N; i++) {
			sc.nextInt(); // u を読み飛ばし
			int k = sc.nextInt();
			for (int j = 0; j < k; j++) {
				int v = sc.nextInt();
				int c = sc.nextInt();
				W[i][v] = c;
			}
		}
		dijkstra(0);
		for (int i = 0; i < N; i++) {
			System.out.println(i + " " + distance[i]);
		}
	}

	private static int min(int a, int b) {
		if (a < b)
			return a;
		return b;
	}

	private static void dijkstra(int start) {
		// Arrasys.fill は配列の初期化がデキル便利メソッド．ただし1次元配列のみ
		Arrays.fill(distance, INF);
		Arrays.fill(state, 0);
		distance[start] = 0;

		int p = 0; // 確定頂点番号を保存する変数
		for (int step = 0; step < N; step++) {
			int minimum = INF;
			for (int x = 0; x < N; x++) {
				if (state[x] == 0 && distance[x] < minimum) {
					p = x;
					minimum = distance[x];
				}
			}
			if (minimum == INF) {
				System.err.println("Disconnected Graph!\n");
				System.exit(-1);
			}
			state[p] = 1;
			for (int x = 0; x < N; x++)
				distance[x] = min(distance[x], distance[p] + W[p][x]);
		}

	}
}

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

static const int MAX = 100;
static const int INFTY = 1000000000;
static const int WHITE = 0, BLACK = 2;

int n;
int A[MAX][MAX];
int d[MAX], color[MAX];

void sssp() {
	for (int i = 0; i < n; i++) {
		d[i] = INFTY;
		color[i] = WHITE;
	}

	d[0] = 0;

	while (1) {
		int minv = INFTY, u = -1;
		for (int i = 0; i < n; i++) { 
			if (d[i] < minv && color[i] != BLACK) {
				minv  = d[i];
				u = i;
			}
		}
		if (u == -1) break;
		color[u] = BLACK;

		for (int j = 0; j < n; j++) { 
			if (A[u][j] < INFTY && color[j] != BLACK) {
				d[j] = min(d[j], d[u] + A[u][j]);
			}
		}
	}
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++)	{
		for (int j = 0; j < n; j++) {
			A[i][j] = INFTY;
		}
	}
	
	for (int i = 0; i < n; i++) {
		int u, k, v;
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			int t;
			cin >> v >> t;
			A[u][v] = t;
		}
	}

	sssp();

	for (int i = 0; i < n; i++) {
		cout << i << ' ' << d[i] << endl;
	}

	return 0;
}