Pagini recente » Borderou de evaluare (job #2673832) | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #2649594) | Cod sursa (job #1790445)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], n;
void roy_floyd(){
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][k] != 0 && a[k][j] != 0 && i != j && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0)){
a[i][j] = a[i][k] + a[k][j];
}
}
void citire(){
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin >> a[i][j];
}
void afisare(){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++)
fout << a[i][j] << " ";
fout << '\n';
}
}
int main()
{
citire();
roy_floyd();
afisare();
return 0;
}