Pagini recente » Istoria paginii runda/ytu/clasament | Cod sursa (job #1288273) | tema_laborator | Cod sursa (job #272566) | Cod sursa (job #1586661)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ( "royfloyd.in" );
ofstream g ( "royfloyd.out" );
int A[105][105],n;
void royfloyd()
{
int i,j,k;
for( k = 1; k <= n; k++ )
for( i = 1; i <= n; i++ )
for( 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];
}
int main()
{
int n,i,j;
f >> n;
for( i = 1; i <= n; i++ )
for( j = 1; j <= n; j++ )
f >> A[i][j];
royfloyd();
for( i = 1; i <= n; i++ )
{
for( j = 1; j <= n; j++ )
g << A[i][j] << " " ;
g << '\n';
}
return 0;
}