Pagini recente » Cod sursa (job #659475) | Cod sursa (job #1300261) | Cod sursa (job #2117528) | Cod sursa (job #2771539) | Cod sursa (job #997594)
Cod sursa(job #997594)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,a[101][101];
void read()
{
f>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
f>>a[i][j];
}
void solve()
{
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
for (k=1;k<=n;k++)
if (a[i][k] && a[k][j] && (a[i][k]+a[k][j]<a[i][j] || a[i][j]==0))
a[i][j]=a[i][k]+a[k][j];
}
int afiseaza()
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
if (i==j)g<<"0 ";
else g<<a[i][j]<<' ';
g<<'\n';
}
}
int main()
{
read();
solve();
afiseaza();
f.close();
g.close();
}