Cod sursa(job #144980)
Utilizator | Data | 28 februarie 2008 10:54:25 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
#define min(a,b) ((a<b)?a:b)
long n,i,j,k,a[128][128];
int main(){
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
scanf("%ld",&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]=min(a[i][j],a[i][k]+a[k][j]);
for (i=1;i<=n;i++){
for (j=1;j<=n;j++)
printf("%ld ",a[i][j]);
printf("\n");
}
return 0;
}