Cod sursa(job #2333798)

Utilizator Anastasia11Susciuc Anastasia Anastasia11 Data 1 februarie 2019 22:53:20
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>
#include <cstring>
#define Nmax 105

using namespace std;

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

int n, x;
int a[Nmax][Nmax];

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

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(i!=j && a[i][k]!=0 && a[k][j]!=0 && (a[i][j]==0 || a[i][j] > a[i][k]+a[k][j]) )
                    a[i][j]=a[i][k]+a[k][j];
}

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

int main()
{
    read();
    roy_floyd();
    print();

    return 0;
}