Pagini recente » Cod sursa (job #598392) | Cod sursa (job #2172678) | Cod sursa (job #447485) | Cod sursa (job #3183029) | Cod sursa (job #2327326)
#include <iostream>
#include <fstream>
using namespace std;
int n, a[101][101];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
void royfloyd()
{
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][j]>a[i][k]+a[k][j] || a[i][j]==0) && i!=j) a[i][j]=a[i][k]+a[k][j];
}
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) in>>a[i][j];
royfloyd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) out<<a[i][j]<<" ";
out<<'\n';
}
return 0;
}