Pagini recente » Cod sursa (job #2402849) | Diferente pentru problema/datorii intre reviziile 3 si 7 | Cod sursa (job #470425) | Cod sursa (job #783217) | Cod sursa (job #1124966)
#include <stdio.h>
int n, a[105][105];
void fw_rf () {
int i, j, k;
for (k=1; k<=n; ++k)
for (i=1; i<=n; ++i)
for (j=1; j<=n; ++j) {
if (a[i][k] && a[k][j] && ((a[i][j] > a[i][k]+a[k][j] || !a[i][j]) && i!=j)){
a[i][j] = a[i][k]+a[k][j];
}
}
for (i=1; i<=n; ++i) {
for (j=1; j<=n; ++j) {
printf("%d ", a[i][j]);
}
printf("\n");
}
}
int main (void) {
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i, j;
scanf("%d", &n);
for (i=1; i<=n; ++i) {
for (j=1; j<=n; ++j) {
scanf("%d", &a[i][j]);
}
}
fw_rf();
return 0;
}