Pagini recente » Cod sursa (job #1572079) | Cod sursa (job #415645) | Cod sursa (job #355340) | onis-2015/clasament/runda-finala | Cod sursa (job #1207632)
#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,k,a[105][105];
void citire()
{
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])&&(i!=j)&&(i!=k)&&(j!=k))
if ((a[i][j]==0)||(a[i][j]>a[i][k]+a[k][j])) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
solve();
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}