Pagini recente » Cod sursa (job #507236) | Cod sursa (job #156297) | Cod sursa (job #1338767) | Cod sursa (job #2957703) | Cod sursa (job #2908266)
#include <fstream>
using namespace std;
const int N = 100;
const int INF = 1e9;
int d[N+1][N+1], n;
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
in >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
in >> d[i][j];
if (i != j && d[i][j] == 0)
{
d[i][j] = INF;
}
}
}
in.close();
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (d[i][k] + d[k][j] < d[i][j])
{
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
out << d[i][j] << " ";
}
out << "\n";
}
out.close();
return 0;
}