Pagini recente » Cod sursa (job #310640) | Cod sursa (job #3263390) | Cod sursa (job #1699216) | Cod sursa (job #798259) | Cod sursa (job #3141333)
#include <fstream>
#define MAX 100
#define INF 1000000000
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
int dist[MAX + 10][MAX + 10];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
cin >> dist[i][j];
if (dist[i][j] == 0 && i != j)
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++)
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] == INF)
cout << 0 << ' ';
else
cout << dist[i][j] << ' ';
cout << '\n';
}
return 0;
}