Pagini recente » Cod sursa (job #1448196) | Cod sursa (job #2926128) | Cod sursa (job #1889573) | Cod sursa (job #562984) | Cod sursa (job #154923)
Cod sursa(job #154923)
#include <stdio.h>
#define lim 101
int a[lim][lim];
int n;
void royFloydf() {
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if ( a[i][j] > a[i][k] + a[k][j] )
a[i][j] = a[i][k] + a[k][j];
}
void afis() {
freopen("royfloyd.out", "w", stdout);
for (int i = 0; i < n; i++ ) {
for (int j = 0; j < n; j++)
printf ("%d ", a[i][j]);
printf("\n");
}
fclose(stdout);
}
void citire() {
freopen("royfloyd.in", "r", stdin);
scanf("%d\n", &n);
for (int i = 0; i < n;i++)
for (int j =0; j < n; j++) {
scanf("%d", &a[i][j]);
if (i != j && !a[i][j])
a[i][j] = 1000000;
}
fclose(stdin);
}
int main() {
citire();
royFloydf();
afis();
return 0;
}