Pagini recente » Cod sursa (job #2709299) | Cod sursa (job #1113467) | Cod sursa (job #2708037) | Cod sursa (job #1857328) | Cod sursa (job #2469084)
#include<cstdio>
#define MAX 101
int dp[MAX][MAX],n;
int min(int x,int y){
if(x<y) return x;
return y;
}
void read(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
scanf("%d",&dp[i][j]);
if(!dp[i][j] && i!=j) dp[i][j] = 0x3f3f3f3f;
}
}
}
void floyd(){
for(int k=1;k<=n;++k){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
if( dp[i][k] && dp[k][j])dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
}
}
void write(){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
printf("%d ",dp[i][j]);
}
printf("\n");
}
}
int main(){
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
floyd();
write();
return 0;
}