Pagini recente » Cod sursa (job #1324028) | Cod sursa (job #2590587) | Cod sursa (job #2821409) | Cod sursa (job #1351836) | Cod sursa (job #1118282)
#include <cstdio>
int N, A[101][101];
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) {
if (i == k) continue;
for (int j = 1; j <= N; ++j) {
if (i == j || k == j) 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;
}