Pagini recente » Cod sursa (job #3189347) | Cod sursa (job #784409) | Cod sursa (job #2158958) | Cod sursa (job #2667051) | Cod sursa (job #1310032)
#include <cstdio>
typedef int BYTE;
using namespace std;
BYTE a[102][102];
int n;
void roy_floyd()
{
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];
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%i", &n);
int i,j;
for(i=1; i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%i", &a[i][j]);
}
}
roy_floyd();
for(i=1; i<=n;i++)
{
for(j=1;j<=n;j++)
{
printf("%i ", a[i][j]);
}
printf("\n");
}
return 0;
}