Cod sursa(job #2945334)

Utilizator SerbanCaroleSerban Carole SerbanCarole Data 23 noiembrie 2022 18:30:38
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
using namespace std;

ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");

const int MAX = 1e2+1;

int n, a[MAX][MAX];

int main()
{
    cin >> n;

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

    for(int k = 1; k <= n ; k++){
        for(int i = 1 ; i <= n ; i++){
            for(int j = 1 ; j <= n ; j++){
                if(i==j || i==k || j==k) continue;
                if(!a[i][j]){
                    a[i][j] = a[i][k] + a[k][j];
                    continue;
                }
                a[i][j] = min(a[i][j],a[i][k] + a[k][j]);
            }
        }
    }

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

    return 0;
}