Cod sursa(job #1830228)

Utilizator mateigabriel99Matei Gabriel mateigabriel99 Data 16 decembrie 2016 14:10:22
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>

#define NMax 100+5

using namespace std;

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

int N,cost[NMax][NMax];

void Read();
void Write();

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] && i!=j && ( cost[i][j]>cost[i][k]+cost[k][j] || !cost[i][j]))
                    cost[i][j]=cost[i][k]+cost[k][j];
}

int main()
{
    Read();
    Roy_Floyd();
    Write();

    return 0;
}

void Read()
{
    fin>>N;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            fin>>cost[i][j];
}
void Write()
{
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
            fout<<cost[i][j]<<" ";
        fout<<"\n";
    }
}