Mai intai trebuie sa te autentifici.
Cod sursa(job #2492466)
| Utilizator | Data | 14 noiembrie 2019 19:57:46 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int main()
{
int N, mt[101][101];
f >> N;
int i, j, k;
for(i = 1; i <= N; i++) {
for(j = 1; j <= N; j++)
f >> mt[i][j];
}
for(k = 1; k <= N; k++) {
for(i = 1; i <= N; i++) {
for(j = 1; j <= N; j++) {
if (mt[i][k] && mt[k][j] && (mt[i][j] > mt[i][k] + mt[k][j] || !mt[i][j]) && i != j)
mt[i][j] = mt[i][k] + mt[k][j];
}
}
}
for(int i = 1; i <= N; i++) {
for(j = 1; j <= N; j++)
g << mt[i][j] << " ";
g << endl;
}
return 0;
}
