Pagini recente » Cod sursa (job #1979970) | Cod sursa (job #3197260) | Cod sursa (job #2572890) | Cod sursa (job #2780945) | Cod sursa (job #1991030)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int N=110;
const int oo=1000000010;
int n,i,j,k,p[N][N];
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>p[i][j];
if(!p[i][j])
p[i][j]=oo;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
p[i][j]=min(p[i][j],p[i][k]+p[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
p[i][j]<oo?g<<p[i][j]<<' ':g<<"0 ";
g<<"\n";
}
return 0;
}