Pagini recente » Cod sursa (job #554861) | Cod sursa (job #1965752) | Cod sursa (job #2605695) | Cod sursa (job #2293594) | Cod sursa (job #2768715)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 101, INF = 1e9;
int n, a[N][N], d[N][N];
void roy_floyd()
{
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i == j)
d[i][j] = 0;
else if (a[i][j] == 0)
d[i][j] = INF;
else
d[i][j] = a[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (d[i][k] + d[k][j] < d[i][j])
d[i][j] = d[i][k] + d[k][j];
}
int main()
{
in >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
in >> a[i][j];
roy_floyd();
for (int i = 1; i <= n; ++i, out << '\n')
for (int j = 1; j <= n; ++j)
{
if (d[i][j] == INF)
d[i][j] = 0;
out << d[i][j] << ' ';
}
return 0;
}