Pagini recente » Cod sursa (job #1431495) | Cod sursa (job #1574546) | Cod sursa (job #570090) | Statistici LUNGU FELICIA (cezara) | Cod sursa (job #1489976)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream o("royfloyd.out");
int n, a[1001][1001];
void cititre()
{
f >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f >> a[i][j];
}
void alg()
{
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++)
o<<a[i][j]<<" ";
o<<"\n";
}
}
int main()
{
cititre();
alg();
afisare();
return 0;
}