Cod sursa(job #2580442)

Utilizator Andr31R0BAndreiRob Andr31R0B Data 13 martie 2020 17:11:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

const int dim = (int)(101);

int p[dim][dim], r[dim][dim], n, d;

void royfloyd()
{
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            {
                if(p[i][k] && p[k][j] && (p[i][j]>p[i][k]+p[k][j] || !p[i][j])
                        && i!=j)
                    p[i][j]=p[i][k]+p[k][j];
            }
    }
}
int main()
{
    in>>n;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            in>>p[i][j];
    }

    royfloyd();

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            out<<p[i][j]<<' ';
        out<<'\n';
    }

    in.close();
    out.close();
    return 0;
}