Pagini recente » Cod sursa (job #2882487) | Cod sursa (job #1640136) | Rating Radu Dumitrache (radu16012003) | Cod sursa (job #1296021) | Cod sursa (job #2538740)
#include <fstream>
#include <climits>
#define f in
#define g out
using namespace std;
ifstream in ( "royfloyd.in" );
ofstream out( "royfloyd.out" );
int n, m, i, j, k;
int a[110][110], t[110][110];
const int INF = 2000000000;
int main() {
f>>n;
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ )
f>>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] + a[k][j] < a[i][j] || !a[i][j] ) && a[i][k] && a[k][j] && i != j )
a[i][j] = a[i][k]+a[k][j];
for ( i = 1; i <= n; i++, g<<"\n" )
for ( j = 1; j <= n; j++ )
g<<a[i][j]<<" ";
return 0;
}