Pagini recente » Cod sursa (job #932307) | Cod sursa (job #725934) | Cod sursa (job #2696919) | Cod sursa (job #2091744) | Cod sursa (job #1808911)
#include <cstdio>
#include <iostream>
using namespace std;
int n,i,j,k,a[105][105];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
scanf("%d",&a[i][j]);
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i!=j && j!=k &&i!=k && a[i][k]!=0 && a[k][j]!=0)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}