Cod sursa(job #2081379)

Utilizator dumitru123Patularu Mihai dumitru123 Data 4 decembrie 2017 17:56:07
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define nmax 102
long long a[nmax][nmax],n,m;
int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            f>>a[i][j];

    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                if(i!=j && a[k][j] and a[i][k] )
                    if(a[i][j]>a[i][k]+a[k][j] or a[i][j]==0)
                        a[i][j]=a[i][k]+a[k][j];
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            if(i!=j && !a[i][j]) g<<"0"<<" ";
            else g<<a[i][j]<<" ";
        g<<'\n';
    }

}