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

void shortest_distance(vector<vector<int>>&matrix) {
	int n = matrix.size();
	for(int i=0;i<n;i++){
		matrix[i][i] = 0;
	}
	for(int k=0;k<n;k++){
		for(int i=0;i<n;i++){
			if(i==k) continue;
			for(int j=0;j<n;j++){
				if(i==j or j==k) continue;
				if(matrix[i][k] == -1 or matrix[k][j] == -1) continue;
				matrix[i][j] = matrix[i][j] == -1 ? matrix[i][k]+matrix[k][j] : min(matrix[i][k]+matrix[k][j],matrix[i][j]);
			}
		}
	}
}

int main() {
	int V = 4;
	vector<vector<int>> matrix(V, vector<int>(V, -1));
	matrix[0][1] = 2;
	matrix[1][0] = 1;
	matrix[1][2] = 3;
	matrix[3][0] = 3;
	matrix[3][1] = 5;
	matrix[3][2] = 4;

	shortest_distance(matrix);

	for (auto row : matrix) {
		for (auto cell : row) {
			cout << cell << " ";
		}
		cout << endl;
	}

	return 0;
}