Cod sursa(job #1365267)

Utilizator CosminRusuCosmin Rusu CosminRusu Data 28 februarie 2015 10:58:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>

using namespace std;

const int maxn = 105;
const int oo = 0x3f3f3f3f;

int n, rf[maxn][maxn];

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

    fin >> n;
    for(int i = 0 ; i < n ; ++ i)
        for(int j = 0 ; j < n ; ++ j) {
            fin >> rf[i][j];
            if(!rf[i][j] && i != j)
                rf[i][j] = oo;
        }
    for(int k = 0 ; k < n ; ++ k)
        for(int i = 0 ; i < n ; ++ i)
            for(int j = 0 ; j < n ; ++ j)
                rf[i][j] = min(rf[i][j], rf[i][k] + rf[k][j]);
    for(int i = 0 ; i < n ; ++ i, fout << '\n')
        for(int j = 0 ; j < n ; ++ j) {
            if(rf[i][j] == oo)
                rf[i][j] = 0;
            fout << rf[i][j] << ' ';
        }
}