Pagini recente » Cod sursa (job #2563421) | Cod sursa (job #279146) | Cod sursa (job #210490) | Istoria paginii runda/wunderbareswanker/clasament | Cod sursa (job #2376574)
#include <bits/stdc++.h>
#define N 105
using namespace std;
ifstream fin( "royfloyd.in" );
ofstream fout( "royfloyd.out" );
int n;
int cost[N][N];
void read()
{
int i, j;
fin >> n;
for ( i = 1; i <= n; ++i )
for ( j = 1; j <= n; ++j )
fin >> cost[i][j];
fin.close();
}
void roy_floyd()
{
int k, i, j;
for ( k = 1; k <= n; ++k )
for ( i = 1; i <= n; ++i )
for ( j = 1; j <= n; ++j )
if ( cost[i][j] > cost[i][k] + cost[k][j] )
cost[i][j] = cost[i][k] + cost[k][j];
}
void out()
{
int i, j;
for ( i = 1; i <= n; ++i )
{
for ( j = 1; j <= n; ++j )
fout << cost[i][j] << ' ';
fout << '\n';
}
}
int main()
{
read();
roy_floyd();
out();
fout.close();
return 0;
}