Pagini recente » Cod sursa (job #3173378) | Cod sursa (job #330636) | Cod sursa (job #605282) | Cod sursa (job #611651) | Cod sursa (job #2302763)
#include<cstdio>
#include<climits>
#define MAX 101
int dp[MAX][MAX],n;
int min(int x,int y){
if(x<y) return x;
return y;
}
int main(){
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
scanf("%d",&dp[i][j]);
}
}
for(int k=1;k<=n;++k){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
if(dp[k][j] && dp[i][k])dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
printf("%d ",dp[i][j]);
}
printf("\n");
}
return 0;
}