Pagini recente » Cod sursa (job #3126040) | Cod sursa (job #884787) | Cod sursa (job #1797831) | Cod sursa (job #1221768) | Cod sursa (job #2549098)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, A[101][101];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
fin >> A[i][j];
if (A[i][j] == 0 && i != j)
A[i][j] = 0x3f3f3f3f;
}
}
for (int k = 1; k <= n; ++k)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (A[i][k] + A[k][j] < A[i][j])
A[i][j] = A[i][k] + A[k][j];
}
}
}
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (A[i][j] == 0x3f3f3f3f)
fout << 0 << " ";
else fout << A[i][j] << " ";
}
fout << '\n';
}
return 0;
}