Pagini recente » Cod sursa (job #2585494) | Cod sursa (job #3254978) | Cod sursa (job #809470) | Cod sursa (job #1641654) | Cod sursa (job #1317742)
#include <cstdio>
int a[105][105],n;
void citire()
{
scanf("%d", &n);
int i, j;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
scanf("%d", &a[i][j]);
}
void RF()
{
int i, j, k;
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]||!a[i][j])&&i!=j)
a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
int i, j;
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
printf("%d ", a[i][j]);
printf("\n");
}
}
void rezolva_problema()
{
citire();
RF();
afisare();
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
rezolva_problema();
return 0;
}