Pagini recente » Cod sursa (job #1730590) | Cod sursa (job #1962667) | Cod sursa (job #2738229) | Cod sursa (job #724589) | Cod sursa (job #2806464)
#include <iostream>
#include <bits/stdc++.h>
#define inf 1000000
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int dist[100][100];
int minDist[100][100];
int main()
{
in >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
dist[i][j] = inf;
minDist[i][j] = inf;
}
for (int i = 0; i < n; i++)
minDist[i][i] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
in >> dist[i][j];
minDist[i][j] = dist[i][j];
}
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
//minDist[i][j] = min(min(minDist[i][j], minDist[i][k] + dist[k][j]), dist[i][k] + minDist[k][j]);
if (k != i && k != j && i != j && (minDist[i][k] + minDist[k][j] < minDist[i][j] || !minDist[i][j]))
minDist[i][j] = minDist[i][k] + minDist[k][j];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
if (minDist[i][j] == inf)
{
out << 0 << ' ';
continue;
}
else
out << minDist[i][j] << ' ';
out << '\n';
}
return 0;
}