Pagini recente » Cod sursa (job #218203) | Cod sursa (job #2632923) | Cod sursa (job #789994) | Cod sursa (job #3238796) | Cod sursa (job #396515)
Cod sursa(job #396515)
#include <iostream>
using namespace std;
int a[101][101],n;
void citire()
{
freopen("royfloyd.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void roy()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(((a[i][j]>a[i][k]+a[k][j])||(!a[i][j])) && (a[i][k]) && (a[k][j]) && (i!=j))
a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
freopen("royfloyd.out","w",stdout);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
citire();
roy();
afisare();
return 0;
}