Cod sursa(job #1644777)

Utilizator larecursividadLa Recursividad larecursividad Data 10 martie 2016 09:23:57
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
#define InFile  "royfloyd.in"
#define OutFile "royfloyd.out"

using namespace std;

void read ();
void solve ();
void print ();

int n;
int a[101][101];

int i, j, k;

int main ()
{
    read ();
    solve ();
    print ();
    return 0;
}

void read ()
{
    ifstream fin (InFile);
    fin >> n;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            fin >> a[i][j];
}

void solve ()
{
    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; 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];
}

void print ()
{
    ofstream fout (OutFile);
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
            fout << a[i][j] << ' ';
        fout << '\n';
    }
}