Pagini recente » Cod sursa (job #2439156) | Cod sursa (job #1835007) | Cod sursa (job #3217459) | Cod sursa (job #247356) | Cod sursa (job #2170299)
#include <fstream>
using namespace std;
const int maxi=15000;
int c[101][101],n,m;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void citire()
{
int x,y,cost;
f >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
f>>c[i][j];
if(c[i][j]==0 & i!=j) c[i][j]=maxi;
}
}
void rf()
{
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if( c[i][j] > c[i][k] + c[k][j] )
c[i][j] = c[i][k] + c[k][j];
}
void afis()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
if( c[i][j] == maxi ) g<<"0 ";
else g << c[i][j] <<" ";
g<<endl;
}
}
int main()
{ citire();
rf();
afis();
}