Cod sursa(job #2153532)

Utilizator RaduVFVintila Radu-Florian RaduVF Data 6 martie 2018 11:57:24
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>

using namespace std;

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

const int NMAX=105;
int M[NMAX][NMAX];
int n;

int minim(int n1, int n2) {
    return n1 < n2 ? n1 : n2;
}

void LgDrum() {
    int i,j,k;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(M[i][k] && M[k][j] && i!=j)
                    if(!M[i][j] || M[i][j]>M[i][k]+M[k][j]) M[i][j]=M[i][k]+M[k][j];
}
int main()
{
    int c;
    fin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fin>>M[i][j];
    LgDrum();
    for(int i=1; i<=n; i++) {
        for(int j=1; j<=n; j++)
            fout<<M[i][j]<<' ';
        fout<<endl;
    }
    return 0;
}