Pagini recente » Cod sursa (job #1956100) | Cod sursa (job #1744756) | Cod sursa (job #1231709) | Cod sursa (job #1653697) | Cod sursa (job #1932454)
#include <cstdio>
using namespace std;
int d[101][101];
int main()
{
freopen ("royfloyd.in","r",stdin);
freopen ("royfloyd.out","w",stdout);
int n;
scanf ("%d",&n);
int i,j,k;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
scanf ("%d",&d[i][j]);
}
}
for (k=1; k<=n; k++)
{
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
if (d[i][k]+d[k][j]<d[i][j]&&i!=j)
{
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
printf ("%d ",d[i][j]);
}
printf ("\n");
}
return 0;
}