Pagini recente » Cod sursa (job #1813168) | Cod sursa (job #1843275) | Cod sursa (job #506909) | Cod sursa (job #2416012) | Cod sursa (job #2867834)
#include <iostream>
#include <vector>
#include <climits>
#define NMAX 103
using namespace std;
int N;
int G[NMAX][NMAX];
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", &G[i][j]);
if(G[i][j] == 0) {
G[i][j] = INT_MAX;
}
}
}
for(int k = 1; k <= N; k++) {
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++) {
if(G[i][j] > G[i][k] + G[k][j] && i != j) {
G[i][j] = G[i][k] + G[k][j];
}
}
}
}
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++) {
if(G[i][j] == INT_MAX) {
printf("0 ");
} else
printf("%d ", G[i][j]);
}
printf("\n");
}
return 0;
}