Cod sursa(job #756433)

Utilizator cristianalex81Cristian Alexandru cristianalex81 Data 9 iunie 2012 17:04:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <stdio.h>
#define dim 101

using namespace std;
int n,a[dim][dim];

void royfloyd()
{
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            for(int k=0;k<n;k++)
            {
                if ((j!=k) && (a[j][i]) && (a[i][k])) //there is valid road from j to k through i
                {
                    int t = a[j][i]+a[i][k];//drum intermediar prin i
                    if ((!a[j][k])||(t<a[j][k])) //the road through i is smaller or there is no direct route
                        a[j][k]=t;
                }
            }
}

int main()
{
    int i,j;
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d",&n);
    for (i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
            scanf("%d",&a[i][j]);
    }

    royfloyd();

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