Cod sursa(job #2222767)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 18 iulie 2018 00:28:29
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <bits/stdc++.h>

using namespace std;
int N;
int adj[500][500];
const int INF = 0x3f3f3f3f;

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    cin >> N;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j) {
            cin >> adj[i][j];
            if (adj[i][j] == 0)
                adj[i][j] = INF;
        }

    for (int opt = 1; opt <= N; ++opt)
        for (int i = 1; i <= N; ++i)
            if (opt != i)
                for (int j = 1; j <= N; ++j)
                    if (opt != j && i != j)
                        adj[i][j] = min(adj[i][j], adj[i][opt] + adj[opt][j]);

    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            if (adj[i][j] >= INF)
                adj[i][j] = 0;
            cout << adj[i][j] << " ";
        }
        cout << "\n";
    }

    return 0;
}