Cod sursa(job #3231421)

Utilizator gBneFlavius Andronic gBne Data 26 mai 2024 12:58:52
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>

using namespace std;

const int NMax = 100;

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

int D[NMax + 5][NMax + 5];

int main()
{
    int N;
    fin >> N;
    for(int i = 1; i <= N; ++ i){
        for(int j = 1; j <= N; ++ j){
            fin >> D[i][j];
        }
    }
    for(int k = 1; k <= N; ++ k){
        for(int i = 1; i <= N; ++ i){
            for(int j = 1; j <= N; ++ j){
                if(i != j){
                    if(D[i][j] > 0){
                        D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
                    }
                    else if(D[i][k] > 0 && D[k][j] > 0){
                        D[i][j] = D[i][k] + D[k][j];
                    }
                }
            }
        }
    }
    for(int i = 1; i <= N; ++ i){
        for(int j = 1; j <= N; ++ j){
            fout << D[i][j] << ' ';
        }
        fout << '\n';
    }
    return 0;
}