Cod sursa(job #721812)

Utilizator test0Victor test0 Data 24 martie 2012 10:52:34
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <stdio.h>
#define INF 0xFA000
int c[101][101],n;

int min(int a,int b){ return a<b?a:b; }
void roy_floyd(){
    int i,j,k;
    for(k=1;k<=n;k++)
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    if(i!=j&&i!=k&&j!=k)c[i][j]=min(c[i][j],c[i][k]+c[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",&c[i][j]);
            if(c[i][j]==0)c[i][j]=INF; }
    roy_floyd();
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        if(c[i][j]==INF)c[i][j]=0;
    for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++)printf("%d ",c[i][j]); printf("\n"); }
}