Cod sursa(job #2559982)

Utilizator NotTheBatmanBruce Wayne NotTheBatman Data 27 februarie 2020 18:43:52
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>
#include <stack>

using namespace std;

const int N = 105, oo = 1e9;

int a[N][N], n;

void Read ()
{
    ifstream fin ("royfloyd.in");
    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            fin >> a[i][j];
            if (!a[i][j]) a[i][j] = oo;
        }
    fin.close();
}

void Solve ()
{
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (i != j && j != k && i != k && a[i][j] > a[i][k] + a[k][j])
                    a[i][j] = a[i][k] + a[k][j];
    ofstream fout ("royfloyd.out");
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            if (a[i][j] == oo) fout << "0 ";
            else fout << a[i][j] << " ";
        fout << "\n";
    }
    fout.close();
}

int main()
{
    Read();
    Solve();
    return 0;
}