Cod sursa(job #2422717)

Utilizator MateiAruxandeiMateiStefan MateiAruxandei Data 19 mai 2019 19:04:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>

#define INF (1 << 30)
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)
            if(AP[i][j] == 0)
                AP[i][j] = INF;

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