Pagini recente » Cod sursa (job #1121966) | Cod sursa (job #2567477) | Cod sursa (job #1624227) | Cod sursa (job #820042) | Cod sursa (job #1497775)
#include <stdio.h>
#define MAXN 105
#define INF 1000000000
using namespace std;
int n, ma[MAXN][MAXN];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
scanf("%d", &ma[i][j]);
if(!ma[i][j]) ma[i][j] = INF;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(ma[i][k] + ma[k][j] < ma[i][j])
ma[i][j] = ma[i][k] + ma[k][j];
for(int i = 1; i <= n; i++, printf("\n"))
for(int j = 1; j <= n; j++) {
if(i == j || ma[i][j] == INF) printf("0 ");
else printf("%d ", ma[i][j]);
}
return 0;
}