Pagini recente » Cod sursa (job #1096481) | Cod sursa (job #682131) | Cod sursa (job #308289) | Cod sursa (job #1011770) | Cod sursa (job #1921066)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define nmax 110
int a[nmax][nmax];
int n;
int main()
{
int i,j,k;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i!=j and a[i][k] and a[k][j] and (a[i][k]+a[k][j]<a[i][j] or !a[i][j]))
a[i][j]=a[i][k]+a[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';
}
return 0;
}