Pagini recente » Cod sursa (job #2400424) | Cod sursa (job #2625967) | Cod sursa (job #1380238) | Cod sursa (job #390911) | Cod sursa (job #2852800)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int drumuri[301][301];
int n;
void citire()
{
f >> n;
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
f >>drumuri[i][j];
}
}
void calc()
{
for(int intermediar = 1;intermediar<=n;intermediar++)
{
for(int inceput = 1;inceput<=n;inceput++)
{
for(int fin = 1;fin<=n;fin++)
{
drumuri[inceput][fin] = min(drumuri[inceput][fin],drumuri[inceput][intermediar]+drumuri[intermediar][fin]);
}
}
}
}
void afisare()
{
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
g << drumuri[i][j]<< " ";
g << endl;
}
}
int main()
{
citire();
calc();
afisare();
}