Pagini recente » Cod sursa (job #2663186) | Cod sursa (job #1929695) | Cod sursa (job #1530521) | Cod sursa (job #3001882) | Cod sursa (job #1382530)
#include <fstream>
using namespace std;
ifstream f("graf.in");
ofstream g("graf.out");
int a[50][50],n,x;
void xd()
{
f >> n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
f>>x;
if ((i!=j)&&(x==0))
a[i][j]=10000000;
else a[i][j]=x;
}
}
void drumuri_R_F()
{
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]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
void afisare ()
{
for(int i=1; i<=n; ++i)
{ for (int j=1; j<=n; ++j)
g<<a[i][j]<<" ";
g<<"\n";
}
}
int main()
{ xd();
drumuri_R_F();
afisare();
g.close();
return 0;
}