Cod sursa(job #2290135)

Utilizator alex.carpCarp Alexandru alex.carp Data 25 noiembrie 2018 20:12:50
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMAX=105;
const int oo=(1<<20);
int a[NMAX][NMAX],n;
void citire()
{
    f>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f>>a[i][j];

}
void floyd()
{
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if((a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && a[i][k] && a[k][j])a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            {if(i!=j)g<<a[i][j]<<" ";
            else g<<0<<" ";
            }
        g<<'\n';
    }
}
int main()
{ citire();
floyd();
afisare();

    return 0;
}