Pagini recente » Cod sursa (job #2414116) | Cod sursa (job #2485799) | Cod sursa (job #2293151) | Cod sursa (job #64217) | Cod sursa (job #756433)
Cod sursa(job #756433)
#include <stdio.h>
#define dim 101
using namespace std;
int n,a[dim][dim];
void royfloyd()
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for(int k=0;k<n;k++)
{
if ((j!=k) && (a[j][i]) && (a[i][k])) //there is valid road from j to k through i
{
int t = a[j][i]+a[i][k];//drum intermediar prin i
if ((!a[j][k])||(t<a[j][k])) //the road through i is smaller or there is no direct route
a[j][k]=t;
}
}
}
int main()
{
int i,j;
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for (i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
royfloyd();
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}