Pagini recente » Cod sursa (job #2425466) | Cod sursa (job #2731043) | Cod sursa (job #1057218) | Cod sursa (job #1789872) | Cod sursa (job #2603846)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int dist[101][101], distMin[101][101];
const int inf = 2000000000;
int main()
{
f >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
{
f >> dist[i][j];
if (dist[i][j] == 0)
dist[i][j] = inf;
if (i != j)
distMin[i][j] = dist[i][j];
}
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
distMin[i][j] = min(distMin[i][j], distMin[i][k] + distMin[k][j]);
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
g << distMin[i][j] << " ";
g << "\n";
}
return 0;
}