Pagini recente » Cod sursa (job #2717207) | Cod sursa (job #628217) | Cod sursa (job #1119728) | Cod sursa (job #2242884) | Cod sursa (job #1091064)
#include <climits>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAXN = 109, MAAX = 1003000987;
int dist[MAXN][MAXN], N;
void citire()
{
fin >> N;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
{
fin >> dist[i][j];
if ( dist[i][j] == 0 && i != j )
dist[i][j] = MAAX;
}
}
void update()
{
for (int k = 1; k <= N; ++k)
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
if ( dist[i][k] + dist[k][j] < dist[i][j] )
dist[i][j] = dist[i][k] + dist[k][j];
}
void afisare()
{
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= N; ++j)
fout << dist[i][j] << " ";
fout << "\n";
}
}
int main ()
{
citire();
update();
afisare();
fin.close();
fout.close();
return 0;
}