Pagini recente » Cod sursa (job #411481) | Cod sursa (job #835790) | Cod sursa (job #1008827) | Cod sursa (job #134188) | Cod sursa (job #1621029)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[101][101];
void citire()
{
fin>>n;
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
fin>>a[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 (a[i][k] && a[k][j] && i!=j)
if (a[i][j] > a[i][k] + a[k][j] || !a[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<<'\n';
}
}
int main()
{
citire();
RoyFloyd();
afisare();
return 0;
}