Pagini recente » Cod sursa (job #1401181) | Cod sursa (job #2006777) | Cod sursa (job #1891718) | Cod sursa (job #906258) | Cod sursa (job #2025973)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int a[MAXN][MAXN];
int main()
{
FILE *fin, *fout;
int n, i, j, k;
fin = fopen ("royfloyd.in", "r");
fscanf (fin, "%d", &n);
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
fscanf (fin, "%d", &a[i][j]);
fclose (fin);
for (k = 0; k < n; k++)
for (i = 0; i < n; i++)
for (j = 0; 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];
fout = fopen ("royfloyd.out", "w");
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
fprintf (fout, "%d ", a[i][j]);
fprintf (fout, "\n");
}
fclose (fout);
return 0;
}