Cod sursa(job #3286859)

Utilizator amancei_nicolasAmancei Nicolas amancei_nicolas Data 14 martie 2025 19:02:11
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <bits/stdc++.h>
#define oo 2e9
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
vector<int> G[100005];

int D[105][105], n;

void Roy()
{
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
    {
        if (D[i][j] == 0 && i != j)
            D[i][j] = oo;
    }
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(D[i][j] > D[i][k] + D[k][j])
                    D[i][j] = D[i][k]+ D[k][j];
}

int main()
{
    cin >> n;
    for(int i = 1; i <= n ; i++)
        for(int j = 1; j <= n; j++)
    {
        cin >> D[i][j];
    }
    Roy();
    for(int i = 1; i <= n ; i++)
    {
        for(int j = 1; j <= n; j++)
            cout << D[i][j] << " ";
        cout << '\n';
    }
   return 0;
}