Pagini recente » Cod sursa (job #545038) | Cod sursa (job #1236102) | Cod sursa (job #958108) | Cod sursa (job #1460474) | Cod sursa (job #496401)
Cod sursa(job #496401)
#include <fstream>
using namespace std;
int N;
int M[128][128];
void read()
{
ifstream fin("royfloyd.in");
fin >> N;
for (int i = 0; i < N; ++i)
{
for (int j = 0; j < N; ++j)
{
fin >> M[i][j];
}
}
fin.close();
}
void solve()
{
for (int k = 0; k < N; ++k)
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
if (i != j && M[i][k] > 0 && M[k][j] > 0 && M[i][j] > M[i][k] + M[k][j])
M[i][j] = M[i][k] + M[k][j];
}
void write()
{
ofstream fout("royfloyd.out");
for (int i = 0; i < N; ++i)
{
for (int j = 0; j < N; ++j)
{
fout << M[i][j] << ' ';
}
fout << '\n';
}
fout.close();
}
int main()
{
read();
solve();
write();
return 0;
}