Cod sursa(job #2695039)

Utilizator andreea.vasilescuAndreea Vasilescu andreea.vasilescu Data 11 ianuarie 2021 16:46:35
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include<stdio.h>
#define nmax 200
int fl[nmax][nmax];

inline int min(const int a,const int b)
{
    if( !a )
        return b;
    if( b<a )
        return b;
    return a;
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);

    int n,i,j,q;

    scanf("%d",&n);

    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            scanf("%d",&fl[i][j]);

    int aux;

    for(q=1; q<=n; ++q)
        for(i=1; i<=n; ++i)
            if(i!=q)
                for(j=1; j<=n; ++j){
                    aux=fl[i][j];
                    if( i!=j )
                        if( fl[i][q] && fl[q][j] )
                            fl[i][j]=min(aux,fl[i][q]+fl[q][j]);
                }

    for(i=1; i<=n; ++i){
        for(j=1; j<=n; ++j)
            printf("%d ",fl[i][j]);
        printf("\n");
    }

    return 0;
}