Cod sursa(job #1581958)

Utilizator DiClauDan Claudiu DiClau Data 27 ianuarie 2016 14:14:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include<stdio.h>
using namespace std;
const int N = 105, LIM = 1000*105;
int d[N][N];
void init (int n)
{
    int i, j;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            if (d[i][j] == 0)
                d[i][j] = LIM;
    for (i = 1; i <= n; i++)
        d[i][i] = 0;
}
void roy (int n)
{
    int i, j, k;
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (d[i][k] + d[k][j] < d[i][j])
                    d[i][j] = d[i][k] + d[k][j];
}
int main ()
{
    FILE *in, *out;
    in = fopen ("royfloyd.in", "r");
    out = fopen ("royfloyd.out", "w");
    int n;
    fscanf (in, "%d", &n);
    int i, j;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            fscanf (in, "%d", &d[i][j]);
    init (n);
    roy (n);
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
            fprintf (out, "%d ", d[i][j]);
        fprintf (out, "\n");
    }
    return 0;
}