Pagini recente » Cod sursa (job #2110298) | Cod sursa (job #2283980) | Cod sursa (job #2440085) | Cod sursa (job #2973939) | Cod sursa (job #2720304)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int N;
int distances[101][101];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
// Program
int INF = INT32_MAX / 2 - 100;
f >> N;
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
{
f >> distances[i][j];
}
}
for (int k = 1; k <= N; k++)
{
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
{
if (distances[i][j] > distances[i][k] + distances[k][j])
{
distances[i][j] = distances[i][k] + distances[k][j];
}
}
}
}
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
{
g << distances[i][j] << " ";
}
g << endl;
}
// Exit
f.close();
g.close();
return 0;
}