Pagini recente » Cod sursa (job #2472271) | Cod sursa (job #1560949) | Cod sursa (job #1034229) | Monitorul de evaluare | Cod sursa (job #1048879)
#include <stdio.h>
int n, a[105][105];
void citire() {
freopen( "royfloyd.in", "r" );
freopen( "roufloyd.out", "w" );
int i, j;
scanf("%d", &n);
for( i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
scanf("%d", &a[i][j]);
}
void floyd_warshall() {
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];
}
void afisare() {
int i, j;
for( i = 1; i <= n; i++ ) {
for ( j = 1; j <= n; j++ ) {
printf( "%d ", a[i][j] );
}
printf("\n");
}
}
int main() {
citire();
floyd_warshall();
afisare()
return 0;
}