Cod sursa(job #1815663)

Utilizator Dupree7FMI Ciobanu Andrei Dupree7 Data 25 noiembrie 2016 16:57:44
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>
#include <limits.h>

using namespace std;

#define Nmax 100
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n, a[Nmax][Nmax];

void RoyFloyd()
{
    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][j] > a[i][k] + a[k][j])
                    a[i][j] = a[i][k] + a[k][j];

    for(i = 0; i < n; i++)
        {
        for(j = 0; j < n; j++)
            {
                if(a[i][j] == INT_MAX)
                    a[i][j] = 0;
                g << a[i][j] << " ";
            }
        g << "\n";
        }
}

int main()
{
    f >> n;
    int i, j;

    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
            {
            f >> a[i][j];
            if(a[i][j] == 0 && i != j)
                a[i][j] = INT_MAX;
            }

    RoyFloyd();

    return 0;
}