Cod sursa(job #1128460)

Utilizator 2dorTudor Ciurca 2dor Data 27 februarie 2014 17:12:00
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
using namespace std;

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

const int INF = 0x3f3f3f3f;

int N;
int best[105][105];

void Read() {
    fin >> N;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j) {
            fin >> best[i][j];
            if (i == j)
                best[i][j] = INF;
        }
}

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

void Write() {
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j)
            fout << (i == j ? 0 : best[i][j]) << ' ';
        fout << '\n';
    }
}

int main() {
    Read();
    RoyFloyd();
    Write();
    fin.close();
    fout.close();
    return 0;
}