Cod sursa(job #309371)
Utilizator | Hoaghea Teodor-Andrei d0d0 | Data | 30 aprilie 2009 10:10:13 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
int main(){
int n,k,i,j,a[100][100];
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(i!=j&&a[i][j]==0)
a[i][j]=1001;
}
for(k=1;k<=n;k++)
for(i=1;i<n;i++)
for(j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][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]);
if(i!=n)
printf("\n");
}
return 0;
}