Pagini recente » Cod sursa (job #706546) | Cod sursa (job #420849) | Cod sursa (job #2458032) | Istoria paginii runda/simulare_oji_13_03_2023 | Cod sursa (job #1249963)
#include <cstdio>
using namespace std;
int a[101][101];
int main()
{
int n, i, j, k;
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++) scanf("%d",&a[i][j]);
for (k=1; k<=n; k++)
{
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
if (a[i][j]>a[i][k]+a[k][j])
{
a[i][j]>a[i][k]+a[k][j];
}
}
}
}
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;
}