Pagini recente » Cod sursa (job #2928419) | Cod sursa (job #943702) | Cod sursa (job #1927536) | Cod sursa (job #617761) | Cod sursa (job #2083099)
#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]);
}
}
for(int k = 1; k <= n; ++ k) {
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
printf("%d ", dp[i][j]);
}
printf("\n");
}
return 0;
}