Cod sursa(job #3271618)

Utilizator NeacsuMihaiNeacsu Mihai NeacsuMihai Data 26 ianuarie 2025 18:21:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <bits/stdc++.h>

#define NMAX 100

using namespace std;

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

int dist[NMAX + 1][NMAX + 1];

int main()
{
    int N;
    fin >> N;

    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            fin >> dist[i][j];
        }
    }

    for(int k = 1; k <= N; k++){
        for(int i = 1; i <= N; i++){
            for(int j = 1; j <= N; j++){
                if(dist[i][k] && dist[k][j]){
                    if(i != j && dist[i][j] == 0){
                        dist[i][j] = dist[i][k] + dist[k][j];
                    }
                    else {
                        dist[i][j] = min(dist[i][j],
                                         dist[i][k] + dist[k][j]);
                    }
                }
            }
        }
    }

    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            fout << dist[i][j] << ' ';
        }
        fout << "\n";
    }
    fout << "\n";

    return 0;
}