Pagini recente » Cod sursa (job #487487) | Istoria paginii runda/fulger | Cod sursa (job #2002242) | Istoria paginii runda/gametheory/clasament | Cod sursa (job #2902691)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[1001][1001];
void citire()
{
int i, j;
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
fin >> 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(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 afisare()
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
fout << a[i][j] << " ";
fout << endl;
}
}
int main()
{
fin >> n;
citire();
roy_floyd();
afisare();
return 0;
}