Pagini recente » Cod sursa (job #1766895) | Cod sursa (job #2938991) | Cod sursa (job #131344) | Cod sursa (job #2052563) | Cod sursa (job #177831)
Cod sursa(job #177831)
#include<stdio.h>
#define INF 1000000
int n,p[105][105];
void citire()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%d",&p[i][j]);
if(p[i][j]==0)
p[i][j]=INF;
}
}
void roy()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(p[i][j]>p[i][k]+p[k][j])
p[i][j]=p[i][k]+p[k][j];
for(int i=1;i<=n;++i)
p[i][i]=0;
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
roy();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
printf("%d ", p[i][j] != INF ? p[i][j] : 0);
printf("\n");
}
return 0;
}