Pagini recente » Cod sursa (job #2031641) | Cod sursa (job #1784672) | Cod sursa (job #2347874) | Cod sursa (job #1143712) | Cod sursa (job #2196472)
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
short d[105][105];
int n;
void make_roy()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int 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(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&d[i][j]);
if(d[i][j]==0 && i!=j)
d[i][j]=INF;
}
make_roy();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",d[i][j]);
printf("\n");
}
return 0;
}