Pagini recente » Cod sursa (job #547776) | Cod sursa (job #1886141) | Cod sursa (job #1697737) | Cod sursa (job #2325341) | Cod sursa (job #2416274)
#include <iostream>
#include <cstdio>
#define N 105
using namespace std;
int n, a[N][N];
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(a[i][k] && a[k][j] && i!=j &&
(a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0))
a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; ++i, printf("\n"))
for(int j = 1; j <= n; ++j, printf(" "))
printf("%d", a[i][j]);
return 0;
}