Pagini recente » Cod sursa (job #1806309) | Cod sursa (job #1769482) | Istoria paginii utilizator/cfandrei | Clasament wunderbareswanker | Cod sursa (job #1251355)
# include <cstdio>
# define N 105
using namespace std;
int i,j,a[N][N];
int n;
void royfloyd()
{
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];
return;
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d\n", &n);
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
scanf("%d", &a[i][j]);
royfloyd();
for(i=1; i<=n; ++i)
{
for(j=1; j<=n; ++j)
printf("%d ", a[i][j]);
printf("\n");
}
fclose(stdin);
fclose(stdout);
return 0;
}