Pagini recente » Cod sursa (job #2449734) | Cod sursa (job #1727103) | Cod sursa (job #2250822) | Cod sursa (job #2886851) | Cod sursa (job #2333798)
#include <iostream>
#include <fstream>
#include <cstring>
#define Nmax 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, x;
int a[Nmax][Nmax];
void read()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f >> a[i][j];
}
void roy_floyd()
{
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]==0 || a[i][j] > a[i][k]+a[k][j]) )
a[i][j]=a[i][k]+a[k][j];
}
void print()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << a[i][j] << " ";
g << '\n';
}
}
int main()
{
read();
roy_floyd();
print();
return 0;
}