Pagini recente » Cod sursa (job #337180) | Cod sursa (job #2269412) | Cod sursa (job #2677867) | Cod sursa (job #2259097) | Cod sursa (job #2395994)
#include <iostream>
#include <fstream>
#define nmax 103
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, x[nmax][nmax];
void citire()
{
in >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
in >> x[i][j];
}
void royfloyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(x[i][k] && x[k][j] && (x[i][j] > x[i][k] + x[k][j] ) && i != j)
x[i][j] = x[i][k] + x[k][j];
}
void afisare()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
out << x[i][j] << " ";
out << endl;
}
}
int main()
{
citire();
royfloyd();
afisare();
return 0;
}