Cod sursa(job #2175981)

Utilizator silvereaLKovacs Istvan silvereaL Data 16 martie 2018 20:16:48
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <iostream>
#include <fstream>
#define INT_MAX 213142235

using namespace std;

const int M = 100;
const int inf = INT_MAX;

struct matrix
{
    int n;
    int x[M][M];
}D;

ifstream fcin("royfloyd.in");
ofstream fcout("royfloyd.out");

void beolvas()
{
    fcin >> D.n;
    for (int i = 0; i < D.n; ++i)
        for (int j = 0; j < D.n; ++j)
        {
            fcin >> D.x[i][j];
            if (!D.x[i][j])
                D.x[i][j] = inf;
        }
}

void royfloyd()
{
    for (int k = 0; k < D.n; ++k)
        for (int i = 0; i < D.n; ++i)
            for (int j = 0; j < D.n; ++j)
                if (D.x[i][j] > D.x[i][k] + D.x[k][j])
                    D.x[i][j] = D.x[i][k] + D.x[k][j];
}

void kiir()
{
    for (int i = 0; i < D.n; ++i)
    {
        for (int j = 0; j < D.n; ++j)
            fcout << D.x[i][j] << ' ';
        fcout << '/n';
    }
}

int main()
{
    beolvas();
    royfloyd();
    kiir();
}