Cod sursa(job #2149010)

Utilizator GeorgeCalinPetruta George-Calin GeorgeCalin Data 2 martie 2018 11:30:15
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>
#define nmax 120
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[nmax][nmax],n;

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>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(a[i][k]&&a[k][j]&&(!a[i][j]||a[i][j]>a[i][k]+a[k][j])&&i!=k&&j!=k&&i!=j)
                    a[i][j]=a[i][k]+a[k][j];
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fout<<a[i][j]<<" ";
        }
        fout<<"\n";
    }
    return 0;
}