Pagini recente » Cod sursa (job #1907174) | Cod sursa (job #2137755) | Cod sursa (job #835566) | Cod sursa (job #1387570) | Cod sursa (job #2058184)
#include <bits/stdc++.h>
using namespace std;
int n,a[103][103],INF=2e7;
void cit(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%d",&a[i][j]);
if(i!=j && a[i][j]==0)
a[i][j]=INF;
}
}
void afis()
{
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
printf("%d ",(a[i][j]!=INF)* a[i][j]);
printf("\n");
}
}
void floyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
a[i][j]= min(a[i][j], a[i][k] + a[k][j]);
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
cit();
floyd();
afis();
return 0;
}