Cod sursa(job #2564216)

Utilizator Idk.Voicu Stefan Idk. Data 1 martie 2020 19:09:57
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.96 kb
#include <stdio.h>
#include <stdlib.h>
int a[101][101];
void royfloyd(int n) {
    int i, j, k;
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            for (k = 0; k < n; k++) {
                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;
}