Pagini recente » Cod sursa (job #1593338) | Cod sursa (job #2532918) | Cod sursa (job #208968) | Cod sursa (job #807589) | Cod sursa (job #2017830)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],b[101][101],i,j,n,k;
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++) {f>>a[i][j];}
}
for (k=1;k<=n;k++)
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
if (i!=j&& a[i][k]!=0 && a[k][j]!=0)
{
if (a[i][j]==0) a[i][j]=a[i][k]+a[k][j];
else a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
}
}
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++) g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}