Pagini recente » Cod sursa (job #2668211) | Cod sursa (job #527245) | Cod sursa (job #513333) | Cod sursa (job #2667378) | Cod sursa (job #2075794)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, d[105][105], w[105][105];
void citire(){
in >> n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
in >> d[i][j];
w[i][j] = d[i][j];
}
}
}
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(i != k && j != k && i != j)
if(w[i][k] + w[k][j] < w[i][j])
w[i][j] = w[i][k] + w[k][j];
}
void afisare(){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)
out << w[i][j] << " ";
out << '\n';
}
}
int main()
{
in.sync_with_stdio();
out.sync_with_stdio();
citire();
roy_floyd();
afisare();
return 0;
}