Pagini recente » Cod sursa (job #466095) | Cod sursa (job #2019815) | Monitorul de evaluare | Cod sursa (job #554789) | Cod sursa (job #2018907)
#include<stdio.h>
#define NMAX 100
int a[NMAX][NMAX];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n ; j++) {
scanf("%d", &a[i][j]);
}
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (i !=j && a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
{
a[i][j] = a[i][k] + a[k][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n ; j++) {
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
}