Pagini recente » Cod sursa (job #3192473) | Cod sursa (job #2196039) | Cod sursa (job #3286632) | Cod sursa (job #3239135) | Cod sursa (job #1982818)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 100 + 5;
const int INF = 0x3f3f3f3f;
int n;
int a[NMAX][NMAX];
void read()
{
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
{
fin >> a[i][j];
if (!a[i][j] && i != j)
a[i][j] = INF;
}
}
void roy()
{
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void write()
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
fout << a[i][j] << " ";
fout << '\n';
}
}
int main()
{
read();
roy();
write();
return 0;
}