Cod sursa(job #2571809)

Utilizator uvIanisUrsu Ianis Vlad uvIanis Data 5 martie 2020 10:16:11
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include <bits/stdc++.h>

using namespace std;

const int N_MAX = 100 + 1;
const int oo = 1 << 29;

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

int N, DP[N_MAX][N_MAX];

int main()
{
    fin >> N;

    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j)
        {
            fin >> DP[i][j];

            if(i != j && DP[i][j] == 0) DP[i][j] = oo;
        }


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


     for(int i = 1; i <= N; ++i)
     {
         for(int j = 1; j <= N; ++j)
            fout << DP[i][j] << ' ';

         fout << '\n';
     }
}