Cod sursa(job #3029941)

Utilizator oana75Ioana Prunaru oana75 Data 17 martie 2023 11:59:19
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
#include <iostream>
#include <fstream>

using namespace std;

int A[101][101], DM[101][101], N;

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

int main()
{
    in >> N;
    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++)
        in >> A[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 && (DM[i][j] > A[i][k] + A[k][j] || DM[i][j] == 0))
        DM[i][j] = A[i][k] + A[k][j];
    for(int i = 1; i <= N; i++)
    {
        for(int j = 1; j <= N; j++)
            out << DM[i][j] << " ";
        out << '\n';
    }
    return 0;
}