Cod sursa(job #2518769)

Utilizator mirceatlxhaha haha mirceatlx Data 6 ianuarie 2020 16:30:40
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 105
using namespace std;

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

int rf[NMAX][NMAX];
int N, M;

int main()
{
    int x, y, w;
    fin >> N >> M;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            fin >> rf[i][j];
        }
    }

    for(int k = 1; k <= N; k++){
        for(int i = 1; i <= N; i++){
            for(int j = 1; j <= N; j++){
                if(rf[i][k] && rf[k][j] && (rf[i][j] > rf[i][k] + rf[k][j] || !rf[i][j]) && i != j)
                    rf[i][j] = rf[i][k] + rf[k][j];
            }
        }
    }
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            fout << rf[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}