Pagini recente » Cod sursa (job #549931) | Cod sursa (job #1858189) | Cod sursa (job #190690) | Cod sursa (job #104057) | Cod sursa (job #1999751)
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n,v[105][105];
void read()
{
f>>n;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j) f>>v[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(v[i][k]&&v[k][j]&&(v[i][j]>v[i][k]+v[k][j]||!v[i][j])&&i!=j) v[i][j]=v[i][k]+v[k][j];
}
}
}
void afisare()
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j) g<<v[i][j]<<' ';
g<<'\n';
}
}
int main()
{
read();
solve();
afisare();
return 0;
}