Cod sursa(job #3289165)

Utilizator Cristian_NegoitaCristian Negoita Cristian_Negoita Data 25 martie 2025 22:27:03
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 105;
int a[NMAX][NMAX], dist[NMAX][NMAX], n;

void roy_floyd()
{
    memcpy(dist, a, sizeof(a));
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(a[i][k] != 0 && a[k][j] != 0 && i != j && i != k && j != k)
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}

signed main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> a[i][j];
    roy_floyd();
    for(int i = 1; i <= n; i++, fout << "\n")
        for(int j = 1; j <= n; j++)
            fout << dist[i][j] << " ";

    return 0;
}