Pagini recente » Cod sursa (job #1450278) | Cod sursa (job #2802195) | Cod sursa (job #119053) | Cod sursa (job #2721481) | Cod sursa (job #2603317)
#include <cstdio>
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]);
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)
printf("%d ", M[i][j]);
printf("\n");
}
}