Cod sursa(job #2022160)

Utilizator cristicretancristi cretan cristicretan Data 15 septembrie 2017 20:46:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>
#include <cstdio>
#define NMax 101
using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n, a[NMax][NMax];

int main()
{
    f >> n;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            f >> a[i][j];

    /// ROY FLOYD

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

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

    return 0;
}