Cod sursa(job #2213691)

Utilizator dahaandreiDaha Andrei Codrin dahaandrei Data 16 iunie 2018 22:27:02
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>

using namespace std;

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

const int MAXN = 100;
const int MAXVAL = 1000;
const int inf = 1e5;

int n, g[MAXN + 1][MAXN + 1];

int main() {
	in >> n;

	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= n; ++ j) {
			in >> g[i][j];
			if (g[i][j] == 0)
				g[i][j] = inf;
		}
	}

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

	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= n; ++ j) {
			if (g[i][j] == inf)
				out << 0 << ' ';
			else
				out << g[i][j] << ' ';
		}
		out << '\n';
	}

	return 0;
}