Cod sursa(job #2722831)

Utilizator LeCapataIustinian Serban LeCapata Data 13 martie 2021 12:28:34
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>

using namespace std;

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

int n;
int cost[101][101];

int main()
{
    in>>n;

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            in>>cost[i][j];

    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                if(i != j && cost[i][k] != 0 && cost[k][j] != 0 && cost[i][j] >= cost[i][k] + cost[k][j])
                    cost[i][j] = cost[i][k] + cost[k][j];

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

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