Pagini recente » Cod sursa (job #1269680) | Cod sursa (job #2380804) | Cod sursa (job #384155) | Cod sursa (job #2765) | Cod sursa (job #3239405)
#include <bits/stdc++.h>
using namespace std;
const int MAX = 105;
int dist[MAX][MAX];
int main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
{
cin >> dist[i][j];
if (i != j && dist[i][j] == 0)
dist[i][j] = INT_MAX;
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (dist[i][j] == INT_MAX)
cout << "0 ";
else
cout << dist[i][j] << " ";
}
cout << "\n";
}
return 0;
}