Pagini recente » Cod sursa (job #1426763) | Cod sursa (job #1397088) | Cod sursa (job #313297) | Cod sursa (job #1452459) | Cod sursa (job #2812160)
#include <iostream>
#define NMAX 105
using namespace std;
int n, c[NMAX][NMAX];
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", &c[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(c[i][k] && c[k][j] && (!c[i][j] || c[i][k] + c[k][j] < c[i][j]))
c[i][j] = c[i][k] + c[k][j];
}
for(int i = 1; i <= n; ++i, printf("\n"))
for(int j = 1; j <= n; ++j)
printf("%d ", c[i][j]);
return 0;
}