Cod sursa(job #359488)

Utilizator lovestospoogestan marsh lovestospooge Data 27 octombrie 2009 08:36:11
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include<stdio.h>

int n,i,j,k, a[101][101];

int main()
{
 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]);

 for(k=1;k<=n;k++)
     for(i=1;i<=n;i++)
	  for(j=1;j<=n;j++)
	      if(a[i][k]+a[k][j]<a[i][j]) a[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]);


return 0;
}