Cod sursa(job #788385)

Utilizator round2Test P round2 Data 14 septembrie 2012 17:18:10
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <cstdio>
#include <algorithm>
using namespace std;
#define Inf 0xffffff
#define Max 101

int n,r[Max][Max];

void royfloyd()
{
    int k,i,j;
    for(int k=1;k<=n;k++)
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
        if(i!=j && i!=k && j!=k && r[i][j] > r[i][k] + r[k][j]) r[i][j] = r[i][k] + r[k][j];
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            scanf("%d",&r[i][j]);
            if(r[i][j]==0)r[i][j] = Inf;
        }
    royfloyd();
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)printf("%d ",r[i][j]==Inf?0:r[i][j]);
            printf("\n");
        }
    return 0;
}