Pagini recente » Cod sursa (job #692038) | Cod sursa (job #850005) | Borderou de evaluare (job #658550) | Cod sursa (job #176137) | Cod sursa (job #3350532)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMAX = 100,
INF = (1 << 30);
int A[NMAX + 1][NMAX + 1],
C[NMAX + 1][NMAX + 1];
int N;
void Read()
{
f >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
f >> C[i][j];
}
void RoyFloyd()
{
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
A[i][j] = C[i][j];
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(i != j && A[i][k] && A[k][j] &&
(A[i][j] > A[i][k] + A[k][j] || A[i][j] == 0))
A[i][j] = A[i][k] + A[k][j];
}
void Write()
{
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
g << A[i][j] << ' ';
g << '\n';
}
}
int main()
{
Read();
RoyFloyd();
Write();
f.close();
g.close();
return 0;
}