Pagini recente » Cod sursa (job #12806) | Cod sursa (job #3152941) | Cod sursa (job #4111) | Cod sursa (job #2766772) | Cod sursa (job #2603334)
#include <cstdio>
#define INF 1001
int main() {
int n, M[105][105], i, j, k;
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j) {
scanf("%d", &M[i][j]);
if(M[i][j] == 0)
M[i][j] = INF;
}
for(k = 1; k <= n; ++k)
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
if(M[i][j] > M[i][k] + M[k][j])
M[i][j] = M[i][k] + M[k][j];
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j)
if(M[i][j] == INF)
printf("0 ");
else
printf("%d ", M[i][j]);
printf("\n");
}
}