Pagini recente » Cod sursa (job #3235121) | Cod sursa (job #3263413) | Cod sursa (job #762654) | Cod sursa (job #2123216) | Cod sursa (job #2564410)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[105][105];
int main()
{
int n, i, j, k;
fin >> n;
for ( i = 1 ; i <= n ; i++ )
for ( j = 1 ; j <= n ; j++ )
fin >> a[i][j];
for ( k = 1 ; k <= n ; k++ )
for ( i = 1 ; i <= n ; i++ )
for ( j = 1 ; j <= n ; j++ )
if ( a[i][k] != 0 && a[k][j] != 0 && ( a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0 ) && i != j ) a[i][j] = a[i][k] + a[k][j];
for ( i = 1 ; i <= n ; i++ )
{
for ( j = 1 ; j <= n ; j++ ) fout << a[i][j] << ' ';
fout << '\n';
}
return 0;
}