Cod sursa(job #2422709)

Utilizator MateiAruxandeiMateiStefan MateiAruxandei Data 19 mai 2019 18:57:29
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>

using namespace std;

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

int AP[105][105];

int main()
{
    int n;
    fin >> n;

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

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            for(int k = 1; k <= n; ++k)
                if(AP[i][k] != 0 && AP[k][j] != 0)
                    AP[i][j] = min(AP[i][j], AP[i][k] + AP[k][j]);

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            fout << AP[i][j] << " \n"[j == n];
    return 0;
}