Pagini recente » Cod sursa (job #401831) | Cod sursa (job #371260) | Cod sursa (job #2198071) | Cod sursa (job #2172484) | Cod sursa (job #1492274)
#include <iostream>
#include <cstdio>
using namespace std;
int n,dist[105][105];
void read()
{
scanf("%d",&n);
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
scanf("%d",&dist[i][j]);
}
void floyd()
{
for (int k=1; k<=n; ++k)
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
if (dist[i][j]>dist[i][k]+dist[k][j])
dist[i][j]=dist[i][k]+dist[k][j];
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j)
printf("%d ",dist[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
floyd();
return 0;
}