Pagini recente » Cod sursa (job #262768) | Cod sursa (job #2129460) | Diferente pentru algoritmiada-2016 intre reviziile 11 si 5 | Cod sursa (job #1568339) | Cod sursa (job #1989500)
#include <iostream>
#include <fstream>
#define Nmax 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[Nmax][Nmax];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>a[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++,fout<<'\n')
for(int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
return 0;
}