Cod sursa(job #1835607)

Utilizator hantoniusStan Antoniu hantonius Data 27 decembrie 2016 10:53:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>
#define maxn 102
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int a[maxn][maxn], n;

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

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

void roy_floyd()
{
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (a[i][k] != 0 && a[k][j] != 0 && i != j && (a[i][j] == 0 || a[i][j] > a[i][k] + a[k][j]))
                    a[i][j] = a[i][k] + a[k][j];
}

int main()
{
    read();
    roy_floyd();
    write();
    return 0;
}