Pagini recente » Cod sursa (job #1108251) | Cod sursa (job #367165) | Cod sursa (job #556016) | Cod sursa (job #1372110) | Cod sursa (job #2575171)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 1000000005;
const int DIM = 105;
int v[DIM][DIM],n;
void Read()
{
fin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fin>>v[i][j];
if(!v[i][j])
v[i][j]=INF;
}
}
}
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][j]>v[i][k]+v[k][j] && i!=j)
v[i][j]=v[i][k]+v[k][j];
}
}
}
}
void Print()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(v[i][j]==INF)
fout<<0<<" ";
else
fout<<v[i][j]<<" ";
}
fout<<'\n';
}
}
int main()
{
Read();
Solve();
Print();
}