Cod sursa(job #3211975)

Utilizator vvvvvvvvvvvvvVusc David vvvvvvvvvvvvv Data 10 martie 2024 21:00:01
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <bits/stdc++.h>

using namespace std;

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

int n, d[101][101];

int main(){
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> d[i][j];
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    for(int i = 1; i <= n; i++, fout << '\n')
        for(int j = 1; j <= n; j++)
            fout << d[i][j] << ' ';
    return 0;
}