Pagini recente » Cod sursa (job #2685488) | Cod sursa (job #705004) | Cod sursa (job #226192) | Cod sursa (job #935992) | Cod sursa (job #2158376)
#include <cstdio>
#define N 105
using namespace std;
int a[N][N];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n;
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] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && 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;
}