Pagini recente » Cod sursa (job #1648069) | Cod sursa (job #2058631) | Cod sursa (job #982569) | Cod sursa (job #2216744) | Cod sursa (job #1104846)
#include <stdio.h>
#define NMAX 101
using namespace std;
int A[NMAX][NMAX];
int main() {
int N, k, i, j;
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]);
for (k = 1; k <= N; ++k)
for (i = 1; i <= N; ++i)
for (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 (i = 1; i <= N; ++i) {
for (j = 1; j <= N; ++j)
printf ("%d ", A[i][j]);
printf ("\n");
}
return 0;
}