Pagini recente » Cod sursa (job #2115159) | Cod sursa (job #2677356) | Cod sursa (job #933004) | Cod sursa (job #2246706) | Cod sursa (job #2971291)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 104;
const int INF = 1000004;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int d[NMAX][NMAX];
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> d[i][j];
}
}
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (d[i][k] > 0 && d[k][j] > 0)
{
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}