Cod sursa(job #3228969)

Utilizator FlorinIoanSubtirica Florin Ioan FlorinIoan Data 12 mai 2024 18:03:21
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>
#include <limits.h>

using namespace std;

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

#define NMAX 101
int dist[NMAX][NMAX];

void computeFloyd(int n) {
    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] != INT_MAX && dist[k][j] != INT_MAX)
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}

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

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            fin >> dist[i][j];
            if (i != j && dist[i][j] == 0)
                dist[i][j] = INT_MAX;
        }

    computeFloyd(n);

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

    return 0;
}