Cod sursa(job #2941041)

Utilizator divadddDavid Curca divaddd Data 17 noiembrie 2022 00:35:38
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
#include <climits>
#define MAX 102
using namespace std;
int n,a[MAX][MAX];

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            fin >> a[i][j];
            if(i == j){
                continue;
            }
            if(a[i][j] == 0){
                a[i][j] = INT_MAX;
            }
        }
    }
    for(int k = 1; k <= n; k++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if(a[i][j] > a[i][k]+a[k][j]){
                    a[i][j] = a[i][k]+a[k][j];
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            fout << a[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}