Pagini recente » Cod sursa (job #1558937) | Cod sursa (job #297064) | Cod sursa (job #966433) | Cod sursa (job #1044484) | Cod sursa (job #2160367)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMax=10001;
int n;
int a[NMax][NMax];
void read()
{
f >> n;
for (int i= 1; i<= n; ++i)
for (int j= 1; j<= n; ++j)
{
f >> a[i][j];
if ( !a[i][j])
a[i][j]=NMax;
}
}
void roy_floyd()
{
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 )
if ( a[i][k]+a[k][j] < a[i][j])
a[i][j]= a[i][k] + a[k][j];
}
void print()
{
for (int i= 1; i<= n; ++i)
{
for (int j= 1; j<= n; ++j)
{
if (i==j)
g << "0" << " ";
else
if (a[i][j]==NMax)
g << "0" << " ";
else
g << a[i][j] << " ";
}
g<<endl;
}
}
int main()
{
read();
roy_floyd();
print();
}