Pagini recente » Clasament simulareoni2015cl9 | Istoria paginii utilizator/boghici_eusebiu | Cod sursa (job #2369925) | Monitorul de evaluare | Cod sursa (job #2437576)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
unsigned n;
unsigned a[101][101];
void cit()
{
for(unsigned i=1;i<=n;i++)
for(unsigned j=1;j<=n;j++)
fi>>a[i][j];
}
int main()
{
fi>>n;
cit();
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]&&i!=j&&(a[i][j]>a[i][k]+a[k][j]||!a[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++)
fo<<a[i][j]<<" ";
fo<<'\n';}
return 0;
}