Pagini recente » Cod sursa (job #3351560) | Diferente pentru problema/beyond_the_wall intre reviziile 8 si 9 | Cod sursa (job #3311429) | Cod sursa (job #1607452) | Cod sursa (job #3321232)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101];
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
in>>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]!=0 && a[k][j]!=0 && (a[i][k]+a[k][j]<a[i][j] || a[i][j]==0) && i!=j)
{
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
out<<a[i][j]<<" ";
}
out<<'\n';
}
return 0;
}