Mai intai trebuie sa te autentifici.
Cod sursa(job #2233747)
| Utilizator | Data | 24 august 2018 13:17:48 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.05 kb |
#include <iostream>
#include <fstream>
const int INFINIT = 1001;
int main()
{
std::ifstream in("royfloyd.in");
std::ofstream out("royfloyd.out");
int N;
in >> N;
int A[N + 1][N + 1] = {};
for(int i = 1; i <= N; ++i){
for(int j = 1; j <= N; ++j){
in >> A[i][j];
if(A[i][j] == 0){
A[i][j] = INFINIT;
}
}
}
for(int i = 1; i <= N; ++i){
for(int j = 1; j <= N; ++j){
if(i != j){
for(int k = 1; k <= N; ++k){
if(i != k && k != j && A[i][j] > A[i][k] + A[k][j]){
A[i][j] = A[i][k] + A[k][j];
}
}
}
}
}
for(int i = 1; i <= N; ++i){
for(int j = 1; j <= N; ++j){
if(A[i][j] == INFINIT){
out << 0 << ' ';
}
else{
out << A[i][j] << ' ';
}
}
out << '\n';
}
return 0;
}
