Pagini recente » Borderou de evaluare (job #2476140) | Cod sursa (job #2348126) | Cod sursa (job #2312119)
#include <bits/stdc++.h>
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
int ans[105][105] ;
int n ;
void RoyFloyd() {
register int i, j, k ;
for (k = 1 ; k <= n ; ++ k) {
for (i = 1 ; i <= n ; ++ i) {
for (j = 1 ; j <= n ; ++ j) {
if (ans[i][j] == 0 && ans[i][k] && ans[k][j] && i != j) {
ans[i][j] = ans[i][k] + ans[k][j] ;
continue ; }
if (ans[i][k] && ans[k][j] && i != j) {
ans[i][j] = MIN(ans[i][j], ans[i][k] + ans[k][j]) ; } } } } }
int main() {
freopen("royfloyd.in", "r", stdin) ;
freopen("royfloyd.out", "w", stdout) ;
scanf("%d", &n) ;
register int i, j ;
for (i = 1 ; i <= n ; ++ i) {
for (j = 1 ; j <= n ; ++ j) {
scanf("%d", &ans[i][j]) ; } }
RoyFloyd() ;
for (i = 1 ; i <= n ; ++ i) {
for (j = 1 ; j <= n ; ++ j) {
printf("%d ", ans[i][j]) ; }
printf("\n") ; }
return 0; }