Pagini recente » Cod sursa (job #2526718) | Cod sursa (job #1239191) | Cod sursa (job #2262165) | Cod sursa (job #150930) | Cod sursa (job #1170363)
#include <fstream>
using namespace std;
inline int minim(int a, int b)
{
return a > b ? b : a;
}
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, i, j, k;
int g[101][101];
in >> n;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
in >> g[i][j];
}
}
in.close();
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
for (k = 0; k < n; k++)
{
if (i != j && g[i][k] != 0 && g[k][j] != 0)
g[i][j] = minim(g[i][j], g[i][k] + g[k][j]);
}
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
out << g[i][j] << ' ';
}
out << '\n';
}
out.close();
return 0;
}