Pagini recente » Cod sursa (job #2617566) | Cod sursa (job #1759360) | Cod sursa (job #838186) | Cod sursa (job #340754) | Cod sursa (job #1087151)
#include <iostream>
#include <fstream>
using namespace std;
int n,a[105][105];
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void citire ()
{
int i,j;
f>>n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
f>>a[i][j];
}
void Lungime_drumuri ()
{
int i,j,k;
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (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];
}
int main()
{
int i,j;
citire ();
Lungime_drumuri ();
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
g<<a[i][j]<<' ';
g<<endl;
}
f.close ();
g.close ();
return 0;
}