Pagini recente » Cod sursa (job #3265122) | Cod sursa (job #2748295) | Cod sursa (job #2694854) | Cod sursa (job #139122) | Cod sursa (job #2636138)
#include <fstream>
#include <algorithm>
#include <vector>
#include <iterator>
#include <queue>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define NMAX 105
int mat[NMAX][NMAX],n;
void citire()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
in >> mat[i][j];
}
}
void roy()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if ((mat[i][k] + mat[k][j] < mat[i][j])&&(mat[i][k]&&mat[k][j]))
mat[i][j] = mat[i][k] + mat[k][j];
}
void afisare()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
out << mat[i][j] << ' ';
out << '\n';
}
}
int main()
{
citire();
roy();
afisare();
}