Pagini recente » Cod sursa (job #31596) | Cod sursa (job #597242) | Cod sursa (job #2530449) | Cod sursa (job #1354604) | Cod sursa (job #2682605)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMAX = 101, INF = 1 << 16 - 1;
int d[NMAX][NMAX];
int main()
{
int n;
in >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
int x;
in >> x;
d[i][j] = (x == 0 && i != j) ? INF : x;
}
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (d[i][j] > d[i][k] + d[k][j])
{
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
out << d[i][j] << ' ';
}
out << '\n';
}
return 0;
}