Pagini recente » Cod sursa (job #2484780) | Cod sursa (job #463507) | Cod sursa (job #2021699) | Cod sursa (job #301991) | Cod sursa (job #788384)
Cod sursa(job #788384)
#include <cstdio>
#include <algorithm>
using namespace std;
#define Inf 0xffffff
#define Max 101
int n,r[Max][Max];
void royfloyd()
{
int k,i,j;
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j && i!=k && j!=k && r[i][j] > r[i][k] + r[k][j]) r[i][j] = r[i][k] + r[k][j];
}
int main()
{
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&r[i][j]);
if(r[i][j]==0)r[i][j] = Inf;
}
royfloyd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)printf("%d ",r[i][j]==Inf?0:r[i][j]);
printf("\n");
}
return 0;
}