Pagini recente » Cod sursa (job #1654504) | Cod sursa (job #2198576) | Cod sursa (job #51412) | Cod sursa (job #901666) | Cod sursa (job #1822517)
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <climits>
using namespace std;
const int NMAX = 105;
int mat[NMAX][NMAX];
int N;
void floydWarshall() {
for (int k = 1; k <= N; k++) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
mat[i][j] = min(mat[i][j], mat[i][k] + mat[k][j]);
}
}
}
}
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", &mat[i][j]);
}
}
floydWarshall();
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
printf("%d ", mat[i][j]);
}
printf("\n");
}
}