Pagini recente » Cod sursa (job #1027518) | Cod sursa (job #3262485) | Cod sursa (job #545406) | Cod sursa (job #1537294) | Cod sursa (job #780491)
Cod sursa(job #780491)
#include <cstdio>
#include <algorithm>
using namespace std;
#define Max 101
#define Inf 0xfffff
int n,c[Max][Max];
void royfloyd(){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if( c[i][j] == 0 )c[i][j] = Inf;
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if( i!=k && i!=j && j!=k && c[i][j] > c[i][k] + c[k][j] )
c[i][j] = c[i][k] + c[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",&c[i][j]);
royfloyd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)//printf("%d ",c[i][j]);
if(c[i][j] == Inf)printf("0 ");else printf("%d ",c[i][j]);
printf("\n");
}
return 0;
}