Pagini recente » Cod sursa (job #1335887) | Cod sursa (job #2210082) | Cod sursa (job #2433105) | Cod sursa (job #2032285) | Cod sursa (job #3186731)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int d[105][105];
int main()
{
int i, j, k;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin >> d[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i != k && j != k && i != j)
if (d[i][k] + d[k][j] < d[i][j])
d[i][j] = d[i][k] + d[k][j];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fout << d[i][j] << " ";
fout << "\n";
}
return 0;
}