Pagini recente » Cod sursa (job #3350255) | Cod sursa (job #3314809) | Cod sursa (job #3302803) | Cod sursa (job #3352864) | Cod sursa (job #3321046)
// SOURCE: infoarena.ro
#include <climits>
#include <stdio.h>
#define MAXN 300
#define MIN(a, b) ((a) < (b) ? (a) : (b))
int n;
int dp[MAXN][MAXN];
int main() {
for (int i = 0; i < MAXN; i++)
for (int j = 0; j < MAXN; j++)
dp[i][j] = INT_MAX;
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &dp[i][j]);
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (dp[i][k] == INT_MAX || dp[i][k] == 0)
continue;
for (int j = 0; j < n; j++) {
if (dp[k][j] == INT_MAX || dp[j][k] == 0)
continue;
dp[i][j] = MIN(dp[i][j], dp[i][k] + dp[k][j]);
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
printf("%d ", dp[i][j]);
printf("\n");
}
return 0;
}