Pagini recente » Cod sursa (job #2737900) | Cod sursa (job #2668350) | Cod sursa (job #1226243) | Cod sursa (job #611886) | Cod sursa (job #2202141)
#include <iostream>
#include <fstream>
using namespace std;
int a[102][102],n;
void fct()
{
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(i!=j&&a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]||a[i][j]==0))
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
ifstream fin("royfloyd.in");
fin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
fin>>a[i][j];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(a[i][j]==0&&i!=j)
a[i][j]=-1;
fct();
ofstream fout("royfloyd.out");
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}