Pagini recente » Cod sursa (job #2718242) | Cod sursa (job #1979209) | Cod sursa (job #273421) | Cod sursa (job #1614694) | Cod sursa (job #701837)
Cod sursa(job #701837)
#include<cstdio>
#include<algorithm>
#define maxN 101
using namespace std;
int n, m, i, j, mat[maxN][maxN];
int main() {
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", &mat[i][j]);
if(mat[i][j] == 0 && i != j)
mat[i][j] = maxN*maxN*maxN;
}
int k;
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(mat[i][j] > mat[i][k] + mat[k][j])
mat[i][j] = mat[i][k] + mat[k][j];
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++)
if(mat[i][j] == maxN*maxN*maxN)
printf("0 ");
else printf("%d ", mat[i][j]);
printf("\n");
}
return 0;
}