Pagini recente » Cod sursa (job #387103) | Cod sursa (job #2763661) | Cod sursa (job #576451) | Cod sursa (job #1641986) | Cod sursa (job #2929207)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 1e9;
const int NMAX = 105;
int adj[NMAX][NMAX], n;
inline void solve()
{
for(int k=1;k<=n;++k)
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
adj[i][j] = min(adj[i][j], adj[i][k]+adj[k][j]);
}
}
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
fout << adj[i][j] << ' ';
}
fout << '\n';
}
}
int main()
{
fin >> n;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
fin >> adj[i][j];
if(!adj[i][j] && i!=j)
{
adj[i][j] = INF;
}
}
}
solve();
}