Cod sursa(job #186467)

Utilizator drag0shSandulescu Dragos drag0sh Data 27 aprilie 2008 23:46:06
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <stdio.h>
#define MAX 101
int n,v[MAX][MAX];
void citire(){
    freopen("royfloyd.in","r",stdin);
    scanf("%d",&n);
    int i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++) scanf("%d",&v[i][j]);
    fclose(stdin);
}
void solve(){
        int i,j,k;
        for(k=1;k<=n;k++)
           for(i=1;i<=n;i++)
             for(j=1;j<=n;j++)
                 if(v[i][k]&&v[k][j]&&i!=j)
                        //if(v[i][j])
                        v[i][j]=v[i][j]<v[i][k]+v[k][j]?v[i][j]:v[i][k]+v[k][j];

                          //else v[i][j]=v[i][k]+v[j][k];
}


int main(){
citire();

freopen("royfloyd.out","w",stdout);
int i,j;
solve();
for(i=1;i<=n;i++){
        for(j=1;j<=n;j++) printf("%2d ",v[i][j]);
        printf("\n");
}


return 0;
}