Pagini recente » Cod sursa (job #1327119) | Cod sursa (job #936063) | Cod sursa (job #2477468) | Cod sursa (job #1695464) | Cod sursa (job #2603848)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, x;
int distMin[101][101];
const int inf = 1000000000;
int main()
{
f >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
{
f >> x;
if (x == 0)
x = inf;
if (i != j)
distMin[i][j] = x;
}
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;
}