Pagini recente » Cod sursa (job #1628101) | Cod sursa (job #2280838) | Cod sursa (job #2990955) | Cod sursa (job #822850) | Cod sursa (job #677117)
Cod sursa(job #677117)
#include <cstdio>
#include <cstring>
using namespace std;
int a[111][111],d[111][111], i,j,n;
void floyd ()
{
int i,j,k;
memcpy (d,a,sizeof(a));
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
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]);
floyd();
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
printf ("%d ",d[i][j]);
printf ("\n");
}
return 0;
}