Pagini recente » Cod sursa (job #171404) | Cod sursa (job #1220676) | Cod sursa (job #1699971) | Cod sursa (job #2790850) | Cod sursa (job #2739648)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INFINIT = 1000000000;
const int NMAX = 105;
int mat[NMAX][NMAX], N, M;
void citire()
{
fin >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
fin >> mat[i][j];
}
void roy_floyd()
{
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(!mat[i][j] && i != j)
mat[i][j] = INFINIT;
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(mat[i][j] > mat[i][k] + mat[k][j])
mat[i][j] = mat[i][k] + mat[k][j];
}
void print()
{
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
if(mat[i][j] == INFINIT)
fout << 0 << ' ';
else
fout << mat[i][j] << ' ';
fout << '\n';
}
}
int main()
{
citire();
roy_floyd();
print();
return 0;
}