Pagini recente » Cod sursa (job #2917112) | tema | Istoria paginii runda/oji2003/clasament | Cod sursa (job #1149132) | Cod sursa (job #2359367)
#include <stdio.h>
int n, A[101][101],i,j,k;
int main()
{
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");}
}