Cod sursa(job #792179)

Utilizator cernat.catallinFMI Cernat Catalin Stefan cernat.catallin Data 26 septembrie 2012 18:04:27
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

int Cost[105][105];
int n;

void Read(){
    ifstream f ("royfloyd.in");

    f >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            f >> Cost[i][j];
    f.close();
}

void Roy_floyd(){
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                if(Cost[i][k] && Cost[k][j] && (Cost[i][j] > Cost[i][k] + Cost[k][j] || !Cost[i][j]) && i!=j) Cost[i][j] = Cost[i][k] + Cost[k][j];
}

void Write(){
    ofstream g ("royfloyd.out");
    for(int i = 1; i <= n; ++i, g << "\n")
        for(int j = 1; j <= n; ++j)
            g << Cost[i][j] << " ";
    g.close();
}

int main(){
    Read();
    Roy_floyd();
    Write();
}