Pagini recente » Cod sursa (job #2742655) | Cod sursa (job #2057202) | Cod sursa (job #1352913) | Cod sursa (job #962335) | Cod sursa (job #2017821)
#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];
if (a[i][j]==0) a[i][j]=2000000;
}
for (k=1;k<=n;k++)
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
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++)
{
if (a[i][j]==2000000 || i==j) a[i][j]=0;
g<<a[i][j]<<" ";
}
g<<"\n";
}
return 0;
}