Cod sursa(job #2075877)

Utilizator sebi_andrei2008Lazar Eusebiu sebi_andrei2008 Data 25 noiembrie 2017 19:42:44
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include <iostream>
#include <fstream>
#define NMAX 100
#define INFINITY 100000
using namespace std;

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

void floydWarshall(int M[NMAX][NMAX], int n) {
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++) {
                if (i != j && M[i][k] != INFINITY && M[k][j] != INFINITY)
                    if (M[i][j] > M[i][k] + M[k][j] || M[i][j] == INFINITY)
                        M[i][j] = M[i][k] + M[k][j];
            }
}

int main()
{
    int n, M[NMAX][NMAX];
    fin>>n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) {
            fin>>M[i][j];

            if (M[i][j] == 0)
                M[i][j] = INFINITY;
        }

    floydWarshall(M, n);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (M[i][j] == INFINITY)
                fout<<"0 ";
            else
                fout<<M[i][j]<<' ';
        }
        fout<<"\n";
    }
    return 0;
}