Pagini recente » Cod sursa (job #442480) | Cod sursa (job #969669) | Cod sursa (job #2485102) | Cod sursa (job #1471819) | Cod sursa (job #1447858)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define DIM 101
int n, a[DIM][DIM];
int main()
{
fin >> n;
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
fin >> a[i][j];
for ( int k = 1; k <= n; ++k )
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
if ( a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j )
a[i][j] = a[i][k] + a[k][j];
for ( int i = 1; i <= n; ++i )
{
for (int j = 1; j <= n; ++j )
fout << a[i][j] << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
}