Pagini recente » Cod sursa (job #63720) | Cod sursa (job #806403) | Cod sursa (job #2609554) | Cod sursa (job #2658668) | Cod sursa (job #689449)
Cod sursa(job #689449)
#include <cstdio>
using namespace std;
#define maxN 105
int N , a[maxN][maxN];
int main ()
{
freopen ("royfloyd.in" , "r" , stdin);
freopen ("royfloyd.out" , "w" , stdout);
scanf ("%d" , &N);
for (int i = 1 ; i <= N ; ++i)
for (int j = 1 ; j <= N ; ++j)
scanf ("%d" , &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 (i == j) continue;
if (a[i][k] + a[k][j] == 0) continue;
if (a[i][k] + a[k][j] < a[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)
printf ("%d " , a[i][j]);
printf ("\n");
}
return 0;
}