Pagini recente » Cod sursa (job #1387172) | Cod sursa (job #59434) | Cod sursa (job #2697603) | Cod sursa (job #61286) | Cod sursa (job #2270062)
#include <cstdio>
#include <algorithm>
using namespace std;
int dp[101][101];
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
scanf("%d", &dp[i][j]);
if(dp[i][j] == 0 && i != j) {
dp[i][j] = 1000000000;
}
}
}
for(int k = 1; k <= n; ++ k) {
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
dp[k][i] = min(dp[k][i], dp[k][j] + dp[j][i]);
}
}
}
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
printf("%d ", dp[i][j]);
}
printf("\n");
}
return 0;
}