Pagini recente » Cod sursa (job #180885) | Cod sursa (job #1674940) | Cod sursa (job #804406) | Cod sursa (job #542238) | Cod sursa (job #1496095)
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int A[101][101],N;
void royfloyd()
{
int i, k, j;
for (k = 1;k <= N;++k)
for (i = 1;i <= N;++i)
for (j = 1;j <= N;++j)
if (A[i][k] && A[k][j] && (A[i][k] + A[k][j] < A[i][j] || !A[i][j]) && i!=j )
A[i][j] = A[i][k] + A[k][j];
for (i = 1;i <= N;++i)
{
for (j = 1;j <= N;++j)
out << A[i][j]<<" ";
out << '\n';
}
}
int main()
{
int i, j;
in >> N;
for (i = 1;i <= N;++i)
for (j = 1;j <= N;++j)
in >> A[i][j];
royfloyd();
in.close();
out.close();
return 0;
}