Pagini recente » Clasamentul arhivei educationale | Cod sursa (job #3291512) | Cod sursa (job #236379) | Cod sursa (job #3294059) | Cod sursa (job #3293622)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, m;
int L[105][105];
int main()
{
int i, j, k;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i != j) L[i][j] = 1e9;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin >> L[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (L[i][j] > L[i][k] + L[k][j])
L[i][j] = L[i][k] + L[k][j];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fout << L[i][j] << " ";
fout << "\n";
}
return 0;
}