Pagini recente » Cod sursa (job #3166064) | Cod sursa (job #2648266) | Cod sursa (job #2088774) | Cod sursa (job #959718) | Cod sursa (job #2573297)
#include <bits/stdc++.h>
#define oo 100000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int c[101][101];
void Read()
{
f>>n;
for(int i = 1;i <= n;++i)
for(int j = 1;j <= n;++j)
{
f>>c[i][j];
if(c[i][j] == 0)
c[i][j] = oo;
}
}
void Solve()
{
for(int k = 1;k <= n;++k)
for(int i = 1;i <= n;++i)
for(int j = 1;j <= n;++j)
if(i != j)
c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
for(int i = 1;i <= n;++i)
{
for(int j = 1;j <= n;++j)
{
if(c[i][j] >= oo)
c[i][j] = 0;
g<<c[i][j]<<" ";
}
g<<'\n';
}
}
int main()
{
Read();
Solve();
return 0;
}