Pagini recente » Cod sursa (job #675130) | Cod sursa (job #1321659) | Cod sursa (job #379559) | Cod sursa (job #1095446) | Cod sursa (job #3260127)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[257][257],b[257][257],x;
const int INF = 100000001;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
f>>x;
if(x==0)
a[i][j]=INF;
else
a[i][j]=x,b[i][j]=1;
}
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(i!=j&&j!=k&&i!=k)
{
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j],b[i][j]=;
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(a[i][j]==INF)
g<<0<<" ";
else
g<<a[i][j]<<" ";
}
g<<endl;
}
return 0;
}