Pagini recente » Istoria paginii utilizator/andreighinea1 | Istoria paginii utilizator/floreatoma | Diferente pentru deque-si-aplicatii intre reviziile 21 si 20 | Monitorul de evaluare | Cod sursa (job #1249968)
#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]==0) && i!=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;
}