Cod sursa(job #2525637)

Utilizator vlad082002Ciocoiu Vlad vlad082002 Data 17 ianuarie 2020 17:12:43
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include <bits/stdc++.h>
using namespace std;

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

int a[105][105];
int n;


void citire() {
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> a[i][j];
}



void solve() {
      for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(i != j && a[i][k] && a[k][j])
                    a[i][j] = min(a[i][j], a[i][k]+a[k][j]);
}

void afis() {
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++)
            fout << a[i][j] << ' ';
        fout << '\n';
    }
}

int main() {
    citire();
    solve();
    afis();
}