Cod sursa(job #2158355)

Utilizator rangal3Tudor Anastasiei rangal3 Data 10 martie 2018 12:13:19
Problema Floyd-Warshall/Roy-Floyd Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
#define in "royfloyd.in"
#define out "royfloyd.out"
#define N 103
#define inf int(1e7+3)

using namespace std;

ifstream fin(in);
ofstream fout(out);

int n,v[N][N];

int main()
{
    fin>>n;
    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j)
            fin>>v[i][j];

    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j)
            if(!v[i][j] && i!=j) v[i][j] = inf;

    for(int k=1; k<=n; ++k)
        for(int i=1; i<=n; ++i)
            for(int j=1; j<=n; ++j)
                v[i][j] = min(v[i][j], v[i][k] + v[k][j]);

    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=n; ++j)
            fout<<v[i][j]<<" ";
        fout<<"\n";
    }

    fin.close(); fout.close();
    return 0;
}