Cod sursa(job #2079560)

Utilizator ice_creamIce Cream ice_cream Data 1 decembrie 2017 15:46:59
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");

const int NMAX = 100;

int n;
int a[NMAX + 1][NMAX + 1];

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

void rezolva() {
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) {
				if (i == j) continue;
				if (a[i][k] == 0) continue;
				if (a[k][j] == 0) continue;
				if (a[i][j] == 0)
					a[i][j] = a[i][k] + a[k][j];
				else
					a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
			}
}


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

int main() {
	citeste();
	rezolva();
	scrie();
	return 0;
}