Cod sursa(job #2114044)

Utilizator andreibudoiAndrei Budoi andreibudoi Data 25 ianuarie 2018 14:10:12
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
using namespace std;
int n,a[105][105];
fstream f("royfloyd.in");
ofstream g ("royfloyd.out");

void cit()
{
    f>>n;
    int i,j;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            f>>a[i][j];
}
void afi()
{
    int i,j;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
            g<<a[i][j]<<" ";
        g<<'\n';
    }
}
void roy()
{
    int i,j,k;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(i!=j && a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) )
                    a[i][j]=a[i][k]+a[k][j];
}
int main()
{
    cit();
    roy();
    afi();
    return 0;
}