Pagini recente » Cod sursa (job #2883184) | Cod sursa (job #2851806) | Cod sursa (job #2841117) | Cod sursa (job #1392767) | Cod sursa (job #2086938)
#include <fstream>
#define infinit 100000000
#define DIM 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int A[DIM][DIM];
void read()
{
f>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
{
f>>A[i][j];
if (A[i][j]==0 && i!=j)
A[i][j]=infinit;
}
f.close();
}
void solve()
{
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
A[i][j]=min(A[i][j], A[i][k]+A[k][j]);
}
void write()
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
if (A[i][j]!=infinit)
g<<A[i][j]<<" ";
else
g<<0<<" ";
g<<"\n";
}
g.close();
}
int main()
{
read();
solve();
write();
return 0;
}