Pagini recente » Cod sursa (job #1649108) | Cod sursa (job #1622830) | Cod sursa (job #2163545) | Cod sursa (job #188447) | Cod sursa (job #2570053)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 101, INF = 1e9;
int d[N][N], n, pred[N][N];
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(i == j)
d[i][j] = 0;
else d[i][j] = INF;
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
in >> 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][j] > d[i][k] + d[k][j])
{
d[i][j] = d[i][k] + d[k][j];
pred[i][j] = pred[k][j];
}
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
out << d[i][j] << " ";
out << "\n";
}
return 0;
}