Pagini recente » Cod sursa (job #91744) | Cod sursa (job #2069666) | Cod sursa (job #2297291) | Cod sursa (job #1190866) | Cod sursa (job #2641645)
#include <fstream>
#define N 105
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int nrNod;
int cost[105][105];
int main()
{
in>>nrNod;
for(int i=1; i<=nrNod; ++i)
for(int j=1; j<=nrNod; ++j){
in>>cost[i][j];
}
for(int k=1; k<=nrNod; ++k)
for(int i=1; i<=nrNod; ++i)
for(int j=1; j<=nrNod; ++j)
if(i!=j)
if(cost[i][k] + cost[k][j] < cost[i][j] || cost[i][j] == 0)
cost[i][j] = cost[i][k] + cost[k][j];
for(int i=1; i<=nrNod; ++i){
for(int j=1; j<=nrNod; ++j)
out<<cost[i][j]<<" ";
out<<'\n';
}
in.close();
out.close();
return 0;
}