Pagini recente » Cod sursa (job #2793297) | Cod sursa (job #203662) | Cod sursa (job #2312951) | Cod sursa (job #2771920) | Cod sursa (job #986367)
Cod sursa(job #986367)
#include <fstream>
#define Nmax 110
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,d[Nmax][Nmax];
void ReadInput()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)f>>d[i][j];
}
void RoyFloyd(int d[Nmax][Nmax])
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j && d[i][k]*d[k][j] && (!d[i][j] || d[i][k]+d[k][j]<d[i][j]))
d[i][j]=d[i][k]+d[k][j];
}
void PrintOutput()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)g<<d[i][j]<<' ';
g<<'\n';
}
}
int main()
{
ReadInput();
RoyFloyd(d);
PrintOutput();
f.close();g.close();
return 0;
}