Pagini recente » Cod sursa (job #2242516) | Cod sursa (job #820001) | Cod sursa (job #1968067) | Cod sursa (job #2203975) | Cod sursa (job #1705975)
#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#define MAX_NODES 100
#define INF 999999999
int main(void) {
FILE * fin = fopen("royfloyd.in", "r");
FILE * fout = fopen("royfloyd.out", "w");
int dist[MAX_NODES + 1][MAX_NODES + 1];
int n, c;
fscanf(fin, "%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
fscanf(fin, "%d", &c);
if (c == 0) {
dist[i][j] = INF;
} else {
dist[i][j] = c;
}
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
if (dist[i][j] > dist[i][k] + dist[k][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (dist[i][j] < INF) {
fprintf(fout, "%d ", dist[i][j]);
} else {
fprintf(fout, "0 ");
}
}
fprintf(fout, "\n");
}
fclose(fin);
fclose(fout);
}