Pagini recente » Cod sursa (job #721687) | Cod sursa (job #144670) | Cod sursa (job #2425456) | Cod sursa (job #2470057) | Cod sursa (job #2610091)
#include <bits/stdc++.h>
int n,g[109][109];
int main()
{
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
fin>>n;
for (int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
{
fin>>g[i][j];
if (i!=j && g[i][j]==0)
{
g[i][j]=1e9;
}
}
}
for (int k=1; k<=n; ++k)
{
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j)
{
if(g[i][j]>g[i][k]+g[k][j])
{
g[i][j]=g[i][k]+g[k][j];
}
}
}
}
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j)
{
fout<<g[i][j]<<"\n";
}
fout<<"\n";
}
}