Pagini recente » Istoria paginii runda/winners26/clasament | Cod sursa (job #1221594) | Cod sursa (job #974275) | Cod sursa (job #1016782) | Cod sursa (job #2564236)
#include <stdio.h>
#include <stdlib.h>
int a[101][101];
void royfloyd(int n) {
int i, j, k;
for (k = 0; k < n; k++) {
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][k] > 0 && a[k][j] > 0 && (a[i][j] > a[i][k] + a[k][j] || (a[i][j] == 0 && i != j))) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main()
{
int n;
FILE*in = fopen("royfloyd.in", "r");
FILE*out = fopen("royfloyd.out", "w");
fscanf(in, "%d", &n);
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
fscanf(in, "%d", &a[i][j]);
}
}
royfloyd(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
fprintf(out, "%d ", a[i][j]);
}
fprintf(out, "\n");
}
return 0;
}