Pagini recente » Cod sursa (job #1008521) | Cod sursa (job #2300927) | Cod sursa (job #2634374) | Cod sursa (job #1712918) | Cod sursa (job #2240008)
#include <stdio.h>
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n, a[105][105];
void roy_floyd()
{
int i, j, k;
for (k = 1; k <= n; ++k)
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void read()
{
int i, j;
fin >> n;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
fin >> a[i][j];
}
void write()
{
int i, j;
for (i = 1; i <= n; ++i)
{
for (j = 1; j <= n; ++j)
fout << a[i][j] << " ";
fout << endl;
}
}
int main()
{
read();
roy_floyd();
write();
return 0;
}