Cod sursa(job #2829164)

Utilizator RaresRacsanRares Racsan RaresRacsan Data 8 ianuarie 2022 12:57:21
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>
#include <fstream>

#define infinit 10000000000

using namespace std;

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

int n, ma[110][110];

void afisareMa()
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            fout << ma[i][j] << ' ';
        fout << endl;
    }
}

void royFloyd()
{
    int i, j, k;
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if((ma[i][k] != infinit) && (ma[k][j] != infinit))
                    if(ma[i][j] > ma[i][k] + ma[k][j])
                        ma[i][j] = ma[i][k] + ma[k][j];
}

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

    royFloyd();
    afisareMa();
    return 0;
}