Pagini recente » Cod sursa (job #2989387) | Cod sursa (job #1730041) | Cod sursa (job #1397278) | Cod sursa (job #1681759) | Cod sursa (job #2555301)
#include <fstream>
using namespace std;
const int inf=1<<30;
int d[100][100];
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,x;
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
fin>>x;
if (x==0&&i!=j)
d[i][j]=inf;
else
d[i][j]=x;
}
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
if (i!=j&&i!=k&&j!=k&&d[i][k]+d[k][j]<d[i][j])
d[i][j]=d[i][k]+d[k][j];
}
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
fout<<d[i][j]<<" ";
fout<<"\n";
}
return 0;
}