Cod sursa(job #2158349)

Utilizator rangal3Tudor Anastasiei rangal3 Data 10 martie 2018 12:10:43
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#define N 103
#define oo 32000
#define min(a,b) (a < b ? a:b)

using namespace std;

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

int n;
short v[N][N];
short c;

int main(){

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

    for(int k=1; k<=n; ++k)
        for(int i=1; i<=n; ++i)
            for(int j=1; j<=n; ++j)
            {
                if(v[i][k] != 0 && v[k][j] !=0)
                    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;
}