Cod sursa(job #2448025)

Utilizator BogdanRazvanBogdan Razvan BogdanRazvan Data 15 august 2019 15:18:04
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <bits/stdc++.h>

using namespace std;

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

int a[105][105];

int main()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
    int n;
    fin >> 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(a[i][k] && a[k][j]) a[i][j] = min(a[i][k] + a[k][j], a[i][j]);
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j)
            fout << a[i][j] << " ";
        fout << "\n";
    }
    return 0;
}