Cod sursa(job #1838947)

Utilizator cat_a_stropheTina Elisse Pop cat_a_strophe Data 2 ianuarie 2017 00:45:58
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
using namespace std;
const int NMAX = 100;
int d[100][100];
int main() {
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout);
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; ++ i) {
		for (int j = 0; j < n; ++ j) {
			scanf("%d", &d[i][j]);
		}
	}
	for (int k = 0; k < n; ++ k) {
		for (int i = 0; i < n; ++ i) {
			for (int j = 0; j < n; ++ j) {
				if (d[i][k] && d[k][j] && i != j)
					d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
				if (d[i][k] && d[k][j] && i != j && d[i][j] == 0) {
					d[i][j] = d[i][k] + d[k][j];
				}
			}
		}
	}
	for (int i = 0; i < n; ++ i, printf("\n")) {
		for (int j = 0; j < n; ++ j) {
			printf("%d ", d[i][j]);
		}
	}
	return 0;
}