Cod sursa(job #765799)

Utilizator hainagiudanielHainagiu Daniel hainagiudaniel Data 9 iulie 2012 12:43:20
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<cstdio>
using namespace std;

#define IN "x.in"
#define OUT "x.out"

int n,m[100][100];

void floyd (void)
{
    int t,i,j;
    for (t=0;t<n;t++)
        for(i=0;i<n;i++)
            for (j=0;j<n;j++)
                if(m[i][t]&&m[t][j]&&(m[i][j]>m[i][t]+m[t][j] || !m[i][j])&& i!=j)
                    m[i][j]=m[i][t]+m[t][j];
}

int main(void)
{
    int i,j;
    freopen(IN,"r",stdin);
    freopen(OUT,"w",stdout);
    scanf("%d",&n);
    for (i=0;i<n;i++)
        for (j=0;j<n;j++)
            scanf("%d",&m[i][j]);
    floyd();
    for (i=0;i<n;i++)
    {
        for (j=0;j<n;j++)
            printf("%d ",m[i][j]);
        printf("\n");
    }
    return 0;
}