Cod sursa(job #1290231)

Utilizator andreismara97Smarandoiu Andrei andreismara97 Data 10 decembrie 2014 23:16:01
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");


#define Nmax 101

int M[Nmax][Nmax], N;

void citire()
{
    in>>N;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            in>>M[i][j];
}

void royfloyd()
{
    for(int k=1; k <= N; k++)
        for(int i=1; i <= N; i++)
            for(int j=1; j <= N; j++)
                if(M[i][k] && M[k][j] && i!=j && (M[i][j] > M[i][k]+M[k][j] || M[i][j]==0)) M[i][j] = M[i][k]+M[k][j];
}

void afisare()
{
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
            out<<M[i][j]<<' ';
        out<<'\n';
    }
}

int main ()
{
    citire();
    royfloyd();
    afisare();
    return 0;
}