Pagini recente » Cod sursa (job #2820021) | Cod sursa (job #547858) | Cod sursa (job #416928) | Cod sursa (job #2801421) | Cod sursa (job #2829154)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
const int inf = 999999999;
int main()
{
int n;
fi >> n;
static int d[101][101];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fi >> d[i][j];
}
}
int aux = 1;
while (aux == 1)
{
aux = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
for (int k = 1; k <= n; k++)
{
if (k != i && k != j)
{
if (d[i][k] + d[k][j] < d[i][j])
{
d[i][j] = d[i][k] + d[k][j];
aux = 1;
}
}
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fo << d[i][j] << " ";
}
fo << endl;
}
}