Pagini recente » Cod sursa (job #1104613) | Cod sursa (job #489661) | Cod sursa (job #147187) | Cod sursa (job #1264492) | Cod sursa (job #1579730)
#include <bits/stdc++.h>
using namespace std;
const int N = 128;
int n;
int a[N][N];
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 act = 1; act <= n; ++act)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(i != j and a[i][j] and a[act][j] and a[i][act])
a[i][j] = min(a[i][j], a[act][j] + a[i][act]);
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}