Pagini recente » Cod sursa (job #1852444) | Cod sursa (job #847719) | Cod sursa (job #2614458) | Cod sursa (job #2933246) | Cod sursa (job #2061446)
#include <iostream>
#include <fstream>
#define INF 2000000000
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], prec[101][101], n;
void drum(int i, int j)
{
int k;
k=prec[i][j];
if(i==j)
fout<<i<<" ";
else
{
drum(i, k);
fout<<j<<" ";
}
}
int main()
{
int i, j, k, x;
fin>>n;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
a[i][j]=a[j][i]=INF;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>x;
if(x!=0)
a[i][j]=x;
prec[i][j]=i;
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][k]!=INF && a[k][j]!=INF && a[i][j]>a[i][k]+a[k][j])
{
a[i][j]=a[i][k]+a[k][j];
prec[i][j]=prec[k][j];
}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][j]!=INF)
fout<<a[i][j]<<" ";
else
fout<<0<<" ";
}
fout<<endl;
}
}