Pagini recente » Cod sursa (job #1921884) | Cod sursa (job #1510092) | Cod sursa (job #2799019) | Cod sursa (job #168974) | Cod sursa (job #1799138)
#include <fstream>
using namespace std;
int a[102][102];
int n;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
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++)
{
for(int j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}