Pagini recente » Cod sursa (job #542228) | Cod sursa (job #1587961) | Cod sursa (job #1198069) | Cod sursa (job #301147) | Cod sursa (job #1586663)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ( "royfloyd.in" );
ofstream g ( "royfloyd.out" );
int A[105][105],n;
int main()
{
f >> n;
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
f >> 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++ )
g << A[i][j] << " " ;
g << '\n';
}
return 0;
}