Cod sursa(job #2566492)

Utilizator DinuD11Dinu Dragomirescu DinuD11 Data 2 martie 2020 21:41:39
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>

using namespace std;

int a[100][100], n;

int main() {
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> a[i][j];
    fin.close();
    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] && i!=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';
    }
    fout.close();
    return 0;
}