Pagini recente » Cod sursa (job #824832) | Cod sursa (job #73094) | Istoria paginii runda/simulare_iiot_2019-2020_runda_3/clasament | Cod sursa (job #1108384) | Cod sursa (job #1025676)
#include<stdio.h>
#define NMAX 107
int n, a[NMAX][NMAX];
int main(){
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= n; ++ j)
scanf("%d", &a[i][j]);
for(int k = 1; k <= n; ++ k)
for(int i = 1; i <= n; ++ i)
for(int 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];
for(int i = 1; i <= n; ++ i, printf("\n"))
for(int j = 1; j <= n; ++ j)
printf("%d ", a[i][j]);
return 0;
}