Cod sursa(job #2053063)

Utilizator AlexAxeToporan Victor AlexAxe Data 31 octombrie 2017 14:01:02
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("date.in");
ofstream out("date.out");

const int NMax = 103;
int N, A[NMax][NMax];

void Citire (){
    in >> N;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
            in >> A[i][j];
}

void Afisare (){
    for (int i = 1; i <= N; ++i){
        for (int j = 1; j <= N; ++j)
            out << A[i][j] << " ";
        out << '\n';
    }
}

void RoyFloyd (){
    for (int k = 1; k <= N; ++k)
        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= N; ++j)
                A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
}

int main(){
    Citire();
    RoyFloyd();
    Afisare();
    return 0;
}