Pagini recente » Cod sursa (job #1260793) | Cod sursa (job #2655775) | Cod sursa (job #2138805) | Cod sursa (job #1229292)
#include <cstdio>
#define n_max 100
using namespace std;
int n,a[n_max][n_max],i,j,k;
void read(){
freopen("royfloyd.in","r",stdin);
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void solve(){
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(){
freopen("royfloyd.out","w",stdout);
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main(void){
read();
solve();
write();
}