Pagini recente » simulare_oji_2023_clasele_11_12_12_martie | Cod sursa (job #1912759) | Cod sursa (job #1788818) | Cod sursa (job #2852978) | Cod sursa (job #2852806)
#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];
if(i!=j && drumuri[i][j] == 0)
drumuri[i][j] = (1<<30)-1;
}
}
}
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++)
(drumuri[i][j]!=(1<<30)-1)?g << drumuri[i][j]<< " " : g << "0 ";
g << endl;
}
}
int main()
{
citire();
calc();
afisare();
}