Pagini recente » Cod sursa (job #2278138) | Cod sursa (job #1287442) | Cod sursa (job #1374328) | Cod sursa (job #2532031) | Cod sursa (job #1783172)
#include <fstream>
using namespace std;
long long a[101][101],n;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void citire()
{ fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>a[i][j];
}
void solve()
{ 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]!=0&&a[k][j]!=0&&a[i][j]!=0)
a[i][j]=a[i][k]+a[k][j];
}
void tipar()
{ for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<endl;
}
}
int main()
{
citire();
solve();
tipar();
}