Cod sursa(job #2169905)

Utilizator TooHappyMarchitan Teodor TooHappy Data 14 martie 2018 19:02:27
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <bits/stdc++.h>
using namespace std;
  
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int matrice[110][110];

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

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

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

    in.close(); out.close();
  
    return 0;
}