Pagini recente » Cod sursa (job #1358150) | Cod sursa (job #2856035) | Cod sursa (job #672463) | Cod sursa (job #1437983) | Cod sursa (job #2082616)
#include <bits/stdc++.h>
using namespace std;
int a[101][101],d[101][101],n,i,j,k;
int main()
{
freopen( "royfloyd.in", "r", stdin);
freopen( "royfloyd.out", "w", stdout);
scanf( "%d", &n );
for (i = 1; i <= n; i++ )
for (j = 1; j <= n; j++ )
{
scanf( "%d", &a[i][j] );
d[i][j] = a[i][j];
}
for ( k = 1; k <= n; k++ )
for (i = 1; i <= n; i++ )
for (j = 1; j <= n; j++)
if ( i != j && d[i][j] > d[i][k] + d[k][j] && d[i][k] != 0 && d[k][j] != 0 )
d[i][j] = d[i][k] + d[k][j];
for (i = 1; i <= n; i++ )
{
for (j = 1; j <= n; j++ )
printf("%d ", d[i][j] );
printf("\n");
}
return 0;
}