Pagini recente » Cod sursa (job #2842422) | Cod sursa (job #479441) | Cod sursa (job #699661) | Cod sursa (job #2656219) | Cod sursa (job #1913592)
#include<cstdio>
#include<algorithm>
using namespace std;
int n;
int adj_mat[101][101];
int temp[101][101];
int res[101][101];
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",&adj_mat[i][j]);
temp[i][j]=adj_mat[i][j];
res[i][j]=adj_mat[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)
{
if(res[i][k]!=0&&res[k][j]!=0&&res[i][j]!=0)
{
res[i][j]=min(res[i][j],res[i][k]+res[k][j]);
}
else if(res[i][k]!=0&&res[k][j]!=0&&res[i][j]==0)
{
res[i][j]=res[i][k]+res[k][j];
}
}
}
}
/*for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
res[i][j]=temp[i][j];
}
}*/
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
printf("%d ",res[i][j]);
}
printf("\n");
}
}