Pagini recente » Cod sursa (job #430393) | Cod sursa (job #2383149) | Cod sursa (job #2606173) | Cod sursa (job #942299) | Cod sursa (job #326475)
Cod sursa(job #326475)
#include <stdio.h>
#define N 103
int a[N][N],n;
void read(){
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void solve(){
int i,j,k;
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][k]+a[k][j] || !a[i][j]) && i!=j) a[i][j]=a[i][k]+a[k][j];
}
void write(){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main(){
read();
solve();
write();
return 0;
}