Pagini recente » Cod sursa (job #3170259) | Cod sursa (job #1808771) | Cod sursa (job #2000526) | Cod sursa (job #245034) | Cod sursa (job #1741808)
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 110
using namespace std;
int dist[N][N];
int main(){
int i,j,k,n;
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",&dist[i][j]);
}
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(dist[i][k]==0 || dist[k][j]==0){
continue;
}
if(dist[i][k]+dist[k][j]<dist[i][j]){
dist[i][j]=dist[i][k]+dist[k][j];
}
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
printf("%d ",dist[i][j]);
}
printf("\n");
}
return 0;
}