Cod sursa(job #181052)

Utilizator alexeiIacob Radu alexei Data 17 aprilie 2008 20:33:03
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include<stdio.h>
#define nmax 200
int fl[nmax][nmax];

inline int min(const int a,const int b)
{
       if( !a )
       return b;
       if( b<a )
       return b;
       return a;
       }

int main()
{
 freopen("royfloyd.in","r",stdin);
 freopen("royfloyd.out","w",stdout);
 
 int n,i,j,q;
 
 scanf("%d",&n);
 
 for(i=1; i<=n; ++i)
  for(j=1; j<=n; ++j)
  scanf("%d",&fl[i][j]);   

int aux;

for(q=1; q<=n; ++q)
                     for(i=1; i<=n; ++i)
                      if(i!=q)
                              for(j=1; j<=n; ++j){
                              aux=fl[i][j];
                              if( i!=j )
                                  if( fl[i][q] && fl[q][j] )
                                  fl[i][j]=min(aux,fl[i][q]+fl[q][j]);
                              }

for(i=1; i<=n; ++i){
 for(j=1; j<=n; ++j)
 printf("%d ",fl[i][j]);
 printf("\n");
}
    
    return 0;
}