Pagini recente » Cod sursa (job #1331104) | Cod sursa (job #2891641) | runda/suceavaftw | Cod sursa (job #1467591) | Cod sursa (job #1347843)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
int n,a[101][101],i,j,k;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(!a[i][j])
a[i][j]=1001;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
if(i!=j and i!=k and j!=k)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(a[i][k]==1001)
g<<0<<' ';
else
g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}