Pagini recente » Cod sursa (job #1842605) | Cod sursa (job #1251955) | Cod sursa (job #3278365) | Cod sursa (job #2651906) | Cod sursa (job #508501)
Cod sursa(job #508501)
#include<stdio.h>
#include<stdlib.h>
#include<limits.h>
int path[100][100], n;
void ReadData();
void Royfloyd();
void PrintData();
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
ReadData();
Royfloyd();
PrintData();
return 0;
}
void ReadData() {
int i, j;
scanf("%d", &n);
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
scanf("%d", &path[i][j]);
}
}
}
void Royfloyd() {
int i, j, k;
for(k = 0; k < n; k++) {
for(i = 0; i < n; i++) {
for(j = 0; 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];
}
path[i][j] = (path[i][j] < path[i][k] + path[k][j] ? path[i][j] : path[i][k] + path[k][j]);
}
}
}
}
void PrintData() {
int i, j;
for(i = 0; i < n; i++) {
for(j = 0; j < n - 1; j++) {
printf("%d ", path[i][j]);
}
printf("%d\n", path[i][n-1]);
}
}