Cod sursa(job #677117)

Utilizator chiar_nimeninimeni chiar_nimeni Data 9 februarie 2012 21:12:27
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <cstdio>
#include <cstring>

using namespace std;

int a[111][111],d[111][111], i,j,n;

void floyd ()
{
    int i,j,k;
    memcpy (d,a,sizeof(a));
    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; j<=n; j++)
                if (d[i][j] > d[i][k] + d[k][j])
                    d[i][j] = d[i][k] + d[k][j];
}

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

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

    floyd();

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