Cod sursa(job #1324636)

Utilizator gabrielvGabriel Vanca gabrielv Data 22 ianuarie 2015 16:49:30
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <cstdio>

using namespace std;

#define NMAX 110
#define minim(a,b) ((a<b)?(a):(b))
#define INF (1<<25)

int N;
int RF[NMAX][NMAX];

void Read()
{
    freopen("royfloyd.in","r",stdin);
    scanf("%d",&N);
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
        {
            scanf("%d",&RF[i][j]);

            if(!RF[i][j] && i!=j)
                RF[i][j] = INF;
        }

}

void Solve_RoyFloyd()
{
    for(int k=1;k<=N;k++)
        for(int i=1;i<=N;i++)
            for(int j=1;j<=N;j++)
                RF[i][j] = minim(RF[i][j] , RF[i][k] + RF[k][j]);
}

void Print()
{
    freopen("royfloyd.out","w",stdout);
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
            if(RF[i][j] == INF)
                printf("0 ");
            else
                printf("%d ",RF[i][j]);
        printf("\n");
    }
}

int main()
{
    Read();
    Solve_RoyFloyd();
    Print();
    return 0;
}