Cod sursa(job #1976874)

Utilizator blatulInstitutul de Arta Gastronomica blatul Data 4 mai 2017 14:06:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
using namespace std;

#define NMAX 102
#define INF 1e9

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

int dist[NMAX][NMAX];

void RoyFloyd(const int N) {


    for (int k = 1; k <= N; ++k)
        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= N; ++j)
                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] = INF;
        }
    }

    RoyFloyd(N);

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

    return 0;
}