Cod sursa(job #314614)

Utilizator cipriancxFMI - gr143 Timofte Ciprian cipriancx Data 12 mai 2009 11:06:00
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator c Status done
Runda Arhiva educationala Marime 0.85 kb
#include<stdio.h>

int n,i,j,k,a[100][100],b[100][100];
int max=100001;
int main(void)
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);

scanf("%d",&n);
for(i=1; i<=n; i++)for(j=1; j<=n; j++){scanf("%d",&a[i][j]); 
                                        if(a[i][j]==0 && i!=j)a[i][j]=max;}
                                        

for(i=1; i<=n; i++)
 for(j=1; j<=n; j++)
   for(k=1; k<=n; k++)
   {
    if(a[i][k] && a[k][j] && i!=j)
      if((a[i][k]+a[k][j])<a[i][j]) a[i][j]=a[i][k]+a[k][j];
      
     
      //else if(b[i][j]>(a[i][k]+a[k][j])) b[i][j]=a[i][k]+a[k][j];
    }                                     


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

return 0;
}