Cod sursa(job #2784592)

Utilizator Robys01Robert Sorete Robys01 Data 16 octombrie 2021 21:08:03
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include <bits/stdc++.h>
#define INF (1<<30)
using namespace std;


int n, a[101][101], d[101][101];

void read()
{
    cin>>n;
    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=n; j++) {
            cin>>a[i][j];
            d[i][j] = INF;
        }
}

void floyd()
{
    for(int i = 1; i<=n; i++)
        d[i][i] = 0;

    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=n; j++)
            if(a[i][j])
                d[i][j] = a[i][j];

    for(int k = 1; k<=n; k++)
        for(int i = 1; i<=n; i++)
            for(int j = 1; j<=n; j++) {
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }

    for(int i = 1; i<=n; i++) {
        for(int j = 1; j<=n; j++)
            cout<<d[i][j]<<' ';
        cout<<'\n';
    }
}

int main()
{
    read();
    floyd();
    
    return 0;
}