Pagini recente » Cod sursa (job #2633753) | Cod sursa (job #2605479) | Cod sursa (job #3126097) | Cod sursa (job #2475325) | Cod sursa (job #2567819)
#include <iostream>
#include <fstream>
#define Nmax 110
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int a[Nmax][Nmax];
int d[Nmax][Nmax];
void rf()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i!=j && a[i][k]!=0 && a[k][j]!=0 && (a[i][j] > a[i][k]+a[k][j] || a[i][j] == 0))
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f >> a[i][j];
rf();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << a[i][j] << " ";
g << '\n';
}
return 0;
}