Cod sursa(job #2338980)

Utilizator dahaandreiDaha Andrei Codrin dahaandrei Data 8 februarie 2019 09:57:11
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>
#include <string.h>

using namespace std;

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

const int MAXN = 100;
const int INF = 1e9;

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

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&& i != j)
				g[i][j] = INF;
		}
	}

	for (int k = 1; k <= n; ++ k) {
		for (int i = 1; i <= n; ++ i) {
			for (int j = 1; j <= n; ++ 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;
}