Pagini recente » Cod sursa (job #1957212) | Cod sursa (job #2300463) | Cod sursa (job #864118) | Cod sursa (job #438338) | Cod sursa (job #472320)
Cod sursa(job #472320)
#include <cstdio>
#define MAXN 1010
int main(){
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int i, j, k, N, path[MAXN][MAXN];
scanf("%d", &N);
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
scanf("%d", &path[i][j]);
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
if(path[i][k] && path[k][j] && (path[i][j] > path[i][k]+path[k][j] || !path[i][j]) && i != j)
path[i][j] = path[i][k] + path[k][j];
for(i = 1; i <= N; i++){
for(j = 1; j <= N; j++)
printf("%d ", path[i][j]);
printf("\n");
}
return 0;
}