Cod sursa(job #2480212)

Utilizator gazdac_alex@yahoo.comGazdac Alexandru Eugen [email protected] Data 25 octombrie 2019 08:03:42
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int const maxim = 105;
int const oo = (1 << 30);
int matrice[maxim][maxim];
int n;

void citire() {
	in >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			in >> matrice[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 (matrice[i][j] > matrice[i][k] + matrice[k][j]) {
					matrice[i][j] = matrice[i][k] + matrice[k][j];
				}
			}
		}
	}
}

void afisare() {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			out << matrice[i][j] << " ";
		}
		out << endl;
	}
}

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