Pagini recente » Cod sursa (job #2163644) | Cod sursa (job #2823234) | Cod sursa (job #647761) | Cod sursa (job #644011) | Cod sursa (job #1481213)
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#define inf (1<<30)
#define maxn 105
using namespace std;
int dist[maxn][maxn];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n, tmp;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
scanf("%d", &tmp);
if (i != j) {
if (tmp)
dist[i][j] = tmp;
else
dist[i][j] = inf;
}
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; ++j)
cout << dist[i][j] << " ";
cout << endl;
}
return 0;
}