Pagini recente » Cod sursa (job #1020345) | Cod sursa (job #1999589) | Cod sursa (job #1003225) | Cod sursa (job #937056) | Cod sursa (job #1226751)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 0x3f3f3f3f;
int N;
int 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 (i != j && !A[i][j])
A[i][j] = INF;
}
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] != INF && A[k][j] != INF) && A[i][k] + A[k][j] < A[i][j] && (i != j && i != k && j !=k))
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] == INF)
{
fout << "0";
continue;
}
fout << A[i][j] << ' ';
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}