Cod sursa(job #1916382)

Utilizator dacianfFlorea Dacian dacianf Data 9 martie 2017 09:18:35
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m[101][101],i,j,k;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>m[i][j];
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(m[k][j] and m[i][k] and (m[i][j]>m[k][j]+m[i][k] or !m[i][j]) and i!=j)
                    m[i][j]=m[k][j]+m[i][k];
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++)
            fout<<m[i][j]<<" ";
        fout<<"\n";}
    return 0;
}