Pagini recente » Cod sursa (job #2274168) | Cod sursa (job #1002958) | Cod sursa (job #549619) | Cod sursa (job #847869) | Cod sursa (job #2290135)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMAX=105;
const int oo=(1<<20);
int a[NMAX][NMAX],n;
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
}
void 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][j]>a[i][k]+a[k][j] || !a[i][j]) && a[i][k] && a[k][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++)
{if(i!=j)g<<a[i][j]<<" ";
else g<<0<<" ";
}
g<<'\n';
}
}
int main()
{ citire();
floyd();
afisare();
return 0;
}