Pagini recente » Cod sursa (job #143116) | Cod sursa (job #1280817) | Cod sursa (job #3265466) | Cod sursa (job #1283759) | Cod sursa (job #1049810)
#include <algorithm>
#include <iostream>
#include <fstream>
#define MAX 128
using namespace std;
int n;
int dist[MAX][MAX];
int main() {
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> dist[i][j];
for (int interm = 1; interm <= n; interm++)
for (int start = 1; start <= n; start++)
for (int end = 1; end <= n; end++)
if (dist[start][interm] && dist[interm][end])
dist[start][end] = min(dist[start][end], dist[start][interm] + dist[interm][end]);
for (int i = 1; i <= n; cout << "\n", i++)
for (int j = 1; j <= n; j++)
cout << dist[i][j] << " ";
return 0;
}