Pagini recente » Cod sursa (job #616497) | Cod sursa (job #558422) | Cod sursa (job #2256481) | Cod sursa (job #2530136) | Cod sursa (job #2384309)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[100][100],pred[100][100];
long long oo=1000000;
int main()
{
int i,j;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>m[i][j];
if((m[i][j]==0)&&(i!=j))
{
m[i][j]=oo;
}
}
}
for(int k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(m[i][k]+m[k][j]<m[i][j])
{
m[i][j]=m[i][k]+m[k][j];
pred[i][j]=pred[k][j];
}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(m[i][j]=oo)
{
fout<<0<<" ";
}
fout<<m[i][j]<<" ";
}
fout<<endl;
}
return 0;
}