Cod sursa(job #2338772)

Utilizator dahaandreiDaha Andrei Codrin dahaandrei Data 7 februarie 2019 20:01:27
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
#include <string.h>

using namespace std;

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

const int MAXN = 100;
int g[MAXN + 1][MAXN + 1];
int d[MAXN + 1][MAXN + 1];
int n;

int main() {
	memset(d, 0x3f3f3f3f, sizeof(d));
	in >> n;

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

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

	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= n; ++ j) {
			out << d[i][j] << ' ';
		}
		out << '\n';
	}

	return 0;
}